The Community for Technology Leaders
Green Image
Issue No. 02 - March/April (2012 vol. 9)
ISSN: 1545-5963
pp: 548-559
Biing-Feng Wang , Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan
ABSTRACT
The focus of this paper is the problem of finding all nested common intervals of two general sequences. Depending on the treatment one wants to apply to duplicate genes, Blin et al. introduced three models to define nested common intervals of two sequences: the uniqueness, the free-inclusion, and the bijection models. We consider all the three models. For the uniqueness and the bijection models, we give O(n + Nout)-time algorithms, where Nout denotes the size of the output. For the free-inclusion model, we give an O(n1+ε + Nout)-time algorithm, where ε >; 0 is an arbitrarily small constant. We also present an upper bound on the size of the output for each model. For the uniqueness and the free-inclusion models, we show that Nout = O(n2). Let C = ΣgϵΓ o1(g)o2(5), where Γ is the set of distinct genes, and o1(g) and o2(g) are, respectively, the numbers of copies of g in the two given sequences. For the bijection model, we show that Nout = O(Cn). In this paper, we also study the problem of finding all approximate nested common intervals of two sequences on the bijection model. An O(δn + Nout)-time algorithm is presented, where δ denotes the maximum number of allowed gaps. In addition, we show that for this problem Nout is O(δn3).
INDEX TERMS
Approximation algorithms, Algorithm design and analysis, Bioinformatics, Biological system modeling, Computational modeling, Genomics, Computational biology,conserved gene clusters., Algorithms, data structures, common intervals, comparative genomics
CITATION
Biing-Feng Wang, "Output-Sensitive Algorithms for Finding the Nested Common Intervals of Two General Sequences", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 9, no. , pp. 548-559, March/April 2012, doi:10.1109/TCBB.2011.112
211 ms
(Ver 3.3 (11022016))