Finding longest common segments in protein structures in nearly linear time
Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
Original language | English |
---|---|
Title of host publication | Combinatorial Pattern Matching |
Subtitle of host publication | 23rd Annual Symposium, CPM 2012, Proceedings |
Publisher | Springer Verlag |
Pages | 334-348 |
Volume | 7354 LNCS |
ISBN (print) | 9783642312649 |
Publication status | Published - 2012 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 7354 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (electronic) | 1611-3349 |
Conference
Title | 23rd Annual Symposium on Combinatorial Pattern Matching, CPM 2012 |
---|---|
Place | Finland |
City | Helsinki |
Period | 3 - 5 July 2012 |
Link(s)
Abstract
The Local/Global Alignment (Zemla, 2003), or LGA, is a popular method for the comparison of protein structures. One of the two components of LGA requires us to compute the longest common contiguous segments between two protein structures. That is, given two structures A = (a 1, ..., a n ) and B = (b 1, ..., b n ) where a k , b k ∈ ℝ 3, we are to find, among all the segments f = (a i ,...,a j ) and g = (b i ,...,b j ) that fulfill a certain criterion regarding their similarity, those of the maximum length. We consider the following criteria: (1) the root mean square deviation (RMSD) between f and g is to be within a given t ∈ ℝ; (2) f and g can be superposed such that for each k, i ≤ k ≤ j, ||a k - b k || ≤ t for a given t ∈ . We give an algorithm of time complexity when the first requirement applies, where is the maximum length of the segments fulfilling the criterion. We show an FPTAS which, for any ε∈ ℝ, finds a segment of length at least l, but of RMSD up to (1 + ε)t, in O(nlogn + n/ε) time. We propose an FPTAS which for any given ε∈ ℝ, finds all the segments f and g of the maximum length which can be superposed such that for each k, i ≤ k ≤ j, ||a k - b k || ≤ (1 + ε) t, thus fulfilling the second requirement approximately. The algorithm has a time complexity of O(nlog 2 n/ε 5) when consecutive points in A are separated by the same distance (which is the case with protein structures). © 2012 Springer-Verlag.
Citation Format(s)
Finding longest common segments in protein structures in nearly linear time. / Ng, Yen Kaow; Ono, Hirotaka; Ge, Ling et al.
Combinatorial Pattern Matching: 23rd Annual Symposium, CPM 2012, Proceedings. Vol. 7354 LNCS Springer Verlag, 2012. p. 334-348 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7354 LNCS).
Combinatorial Pattern Matching: 23rd Annual Symposium, CPM 2012, Proceedings. Vol. 7354 LNCS Springer Verlag, 2012. p. 334-348 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7354 LNCS).
Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review