Finding nested common intervals efficiently

Journal of Computational Biology

Volumn 17, Issue 9, 2010, Pages 1183-1194

  Blin, Guillaume ^a   Faye, David ^a,b   Stoye, Jens ^c  

^a UNIVERSITÉ PARIS EST   (France)

^b UNIVERSITÉ GASTON BERGER   (Senegal)

^c BIELEFELD UNIVERSITY   (Germany)

Author keywords

algorithms; combinatarics; genomic rearrangements; suffix trees

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; BIOLOGY; GENE DUPLICATION; GENOME; MATHEMATICS; METHODOLOGY; MOLECULAR EVOLUTION; MULTIGENE FAMILY; NUCLEOTIDE SEQUENCE;

ALGORITHMS; BASE SEQUENCE; COMPUTATIONAL BIOLOGY; EVOLUTION, MOLECULAR; GENE DUPLICATION; GENOME; MATHEMATICS; MODELS, GENETIC; MULTIGENE FAMILY;

EID: 77958051274     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2010.0089     Document Type: Article

References (18)

1. Angibaud, S., Fertin, G., Rusu, I., et al. 2009. On the approximability of comparing genomes with duplicates. J. Graph Algor. Appl. 13, 19-53.
2. Bergeron, A., Chauve, C., de Montgolfier, F., et al. 2008a. Computing common intervals of k permutations, with applications to modular decomposition of graphs. SIAM J. Discret. Math. 22, 1022-1039.
3. Bergeron, A., Corteel, S., and Raffinot, M. 2002. The algorithmic of gene teams. Lect. Nate. Comput. Sci. 2452, 464-476.
4. Bergeron, A., Gingras, Y., and Chauve, C. 2008b. Formal models of gene clusters, 177-202. In Mandoiu, I., and Zelikovsky, A., ed. Bioinformatics Algorithms: Techniques and Applications. Wiley, New York.
5. Bergeron, A., and Stoye, J. 2006. On the similarity of sets of permutations and its applications to genome comparison. J. Comput. Biol. 13, 1340-1354.
6. Blin, G., Chauve, C., Fertin, G., et al. 2007. Comparing genomes with duplications: a computational complexity point of view. ACM/IEEE Trans. Comput. Biol. Bioinform. 14, 523-534.
7. Böcker, S., Jahn, K., Mixtacki, J., et al. 2009. Computation of median gene clusters. J. Comput. Biol. 16, 1085-1099.
8. Booth, K. S., and Lueker, G. S. 1976. Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13, 335-379.
9. Didier, G., Schmidt, T., Stoye, J., et al. 2007. Character sets of strings. J. Discr. Alg. 5, 330-340.
10. He, X., and Goldwasser, M. H. 2005. Identifying conserved gene clusters in the presence of homology families. J. Comput. Biol. 12, 638-656.
11. Hoberman, R., and Durand, D. 2005. The incompatible desiderata of gene cluster properties. Lect. Notes Bioinform. 3678, 73-87.
12. Kurzik-Dumke, U., and Zengerle, A. 1996. Identification of a novel Drosophila melanogaster gene, angel, a member of a nested gene cluster at locus 59F4, 5. Biochim. Biophys. Acta 1308, 177-181.
13. Landau, G. M., Parida, L., and Weimann, O. 2005. Gene proximity analysis across whole genomes via PQ trees. J. Comput. Biol. 12, 1289-1306.
14. Ohno, S. 1970. Evolution by Gene Duplication. Springer Verlag, New York.
15. Rahmann, S., and Klau, G. W. 2006. Integer linear programs for discovering approximate gene clusters. Lect. Notes Bioinform. 4175, 298-309.
16. Schmidt, T., and Stoye, J. 2004. Quadratic time algorithms for finding common intervals in two and more sequences. Lect. Notes Comput. Sci. 3109, 347-358.
17. Uno, T., and Yagiura, M. 2000. Fast algorithms to enumerate all common intervals of two permutations. Algorithmica 26, 290-309.
18. Zhang, M., and Leong, H. W. 2009. Gene team tree: a hierarchical representation of gene teams for all gap lengths. J. Comput. Biol. 16, 1383-1398.