Yen Kaow Ng, Hirotaka Ono, Ling-ge, Shuai Cheng Li. Finding Longest Common Segments in Protein Structures in Nearly Linear Time. In Juha Kärkkäinen, Jens Stoye, editors, Combinatorial Pattern Matching - 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012. Proceedings. Volume 7354 of Lecture Notes in Computer Science, pages 334-348, Springer, 2012. [doi]
@inproceedings{NgOGL12, title = {Finding Longest Common Segments in Protein Structures in Nearly Linear Time}, author = {Yen Kaow Ng and Hirotaka Ono and Ling-ge and Shuai Cheng Li}, year = {2012}, doi = {10.1007/978-3-642-31265-6_27}, url = {http://dx.doi.org/10.1007/978-3-642-31265-6_27}, researchr = {https://researchr.org/publication/NgOGL12}, cites = {0}, citedby = {0}, pages = {334-348}, booktitle = {Combinatorial Pattern Matching - 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012. Proceedings}, editor = {Juha Kärkkäinen and Jens Stoye}, volume = {7354}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-31264-9}, }