Gene proximity analysis across whole genomes via PQ trees

Journal of Computational Biology

Volumn 12, Issue 10, 2005, Pages 1289-1306

  Landau, Gad M ^a,b   Parida, Laxmi ^c   Weimann, Oren ^a  

^a UNIVERSITY OF HAIFA   (Israel)

^b POLYTECHNIC UNIVERSITY   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Clusters; Comparative genomics; Evolutionary analysis; Motifs; Pattern discovery; Patterns; Permutation patterns; PQ trees; Whole genome analysis

Indexed keywords

ALGORITHM; ARTICLE; BACILLUS SUBTILIS; BACTERIAL GENOME; CHLOROPLAST; DNA DETERMINATION; DNA SEQUENCE; ESCHERICHIA COLI; GENE CLUSTER; GENOME ANALYSIS; HUMAN; HUMAN GENOME; MATHEMATICAL ANALYSIS; MUTATIONAL ANALYSIS; NONHUMAN; PATTERN RECOGNITION; PHYLOGENETIC TREE CONSTRUCTION METHOD; PQ TREE; PRIORITY JOURNAL; RAT; SEQUENCE ALIGNMENT; STRUCTURAL GENOMICS; ANIMAL; BIOLOGICAL MODEL; BIOLOGY; COMPARATIVE STUDY; ESCHERICHIA COLI K 12; GENETICS; GENOME; GENOMICS; METHODOLOGY; MULTIGENE FAMILY; STATISTICS;

ESCHERICHIA COLI K12;

CHLOROPLAST DNA;

ALGORITHMS; ANIMALS; BACILLUS SUBTILIS; COMPUTATIONAL BIOLOGY; DNA, CHLOROPLAST; ESCHERICHIA COLI K12; GENOME, BACTERIAL; GENOME, HUMAN; GENOMICS; HUMANS; MODELS, GENETIC; MULTIGENE FAMILY; RATS;

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

References (20)

1. Alexandersson, M., Cawley, S., and Pachter, L. 2003, SLAM-Cross-species gene finding and alignment with a generalized pair hidden Markov model. Genome Res. 13(3), 496-502.
2. Bergeron, A., Blanchette, M., Chateau, A., and Chauve, C. 2004a. Reconstructing ancestral gene orders using conserved intervals. Proc. 4th Workshop on Algorithms in Bioinformatics (WABI), 14-25.
3. Bergeron, A., Corteel, S., and Raffinot, M. 2002. The algorithmic of gene teams. Proc. 2nd Workshop on Algorithms in Bioinformatics (WABI), 464-476.
4. Bergeron, A., Mixtacki, J., and Stoye, J. 2004b. Reversal distance without hurdles and fortresses. Proc. 15th Ann. Symp. on Combinatorial Pattern Matching (CPM), 388-399.
5. Bergeron, A., and Stoye, J. 2003. On the similarity of sets of permutations and its applications to genome comparison. Proc. 9th Ann. Int. Conf. on Computing and Combinatorics (COCOON), 68-79.
6. Booth, K., and Leuker, G. 1976. Testing for the consecutive ones property, interval graphs, and graph planarity using pq-tree algorithms. J. Comput. System Sci. 13, 335-379.
7. Bray, N., Couronne, O., Dubchak, I., Ishkhanov, T., Pachter, L., Poliakov, A., Rubin, E., and Ryaboy, D. 2003a. Strategies and tools for whole-genome alignments. Genome Res. 13(1), 73-80.
8. Bray, N., Dubchak, I., and Pachter, L. 2003b. AVID: A global alignment program. Genome Res. 13(1), 97-102.
9. Bryan, S.K., Hagensee, M.E., and Moses, R.E. 1987. DNA polymerase III requirement for repair of DNA damage caused by methyl methanesulfonate and hydrogen peroxide. J. Bacteriol. 16(10), 4608-4613.
10. Burns, K.H., Matzuk, M.M., Roy, A., and Yan, W. 2004. Tektin3 encodes an evolutionarily conserved putative testicular micro tubules-related protein expressed preferentially in male germ cells. Molecular Reproduction and Development 67, 295-302.
11. Cosner, M.E., Jansen, R.K., Moret, B.M.E., Raubeson, L.A., Wang, L., Warnow, T., and Wyman, S. 2000. An empirical comparison of phylogenetic methods on chloroplast gene order data in Campanulaceae. Proc. of Gene Order Dynamics, Comparative Maps, and Multigene Families (DCAF), and in Sankoff, D., and Nadeau, J., eds., Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics. Map Alignment, and the Evolution of Gene Families, 99-121, Kluwer Academic Pub., Dordrecht.
12. Didier, G. 2003. Common intervals of two sequences. Proc. 3rd Workshop on Algorithms in Bioinformatics (WABI), 17-24.
13. Eres, R., Landau, G.M., and Parida, L. 2003. A combinatorial approach to automatic discovery of cluster-patterns. Proc. 3rd Workshop on Algorithms in Bioinformatics (WABI), Lecture Notes in Bioinformatics 2812, 139-150.
14. He, X., and Goldwasser, M.H. 2004. Identifying conserved gene clusters in the presence of orthologous groups. Proc. 8th Ann. Int. Conf. on Research in Computational Molecular Biology (RECOMB), 272-280.
15. Heber, S., and Stoye, J. 2001. Finding all common intervals of k permutations. Proc. 12th Ann. Symp. on Combinatorial Pattern Matching (CPM), 207-218.
16. Landau, G.M., Parida, L., and Weimann, O. 2005. Using PQ trees for comparative genomics. Proc. 16th Ann. Symp. on Combinatorial Pattern Matching (CPM).
17. McConnell, R.M. 2004. A certifying algorithm for the consecutive-ones property. Proc. 15th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), 15, 761-770.
18. Mulley, J., and Holland, P. 2004. Small genome, big insights. Nature 431, 916-917.
19. Schmidt, T., and Stoye, J. 2004. Quadratic time algorithms for finding common intervals in two and more sequences. Proc. 15th Ann. Symp. on Combinatorial Pattern Matching (CPM), 347-358.
20. Uno, T., and Yagiura, M. 2000. Fast algorithms to enumerate all common intervals of two permutations. Algorithmica 26(2), 290-309.