Gapped permutation patterns for comparative genomics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4175 LNBI, Issue , 2006, Pages 376-387

  Parida, Laxmi ^a  

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

Author keywords

Clusters; Comparative genomics; Data mining; Evolutionary analysis; Labeled trees; Motifs; Pattern discovery; Patterns; Permutation patterns; Whole genome analysis

Indexed keywords

BIODIVERSITY; DNA; GENES; MATHEMATICAL MODELS; MUTAGENESIS;

COMPARATIVE GENOMICS; EVOLUTIONARY ANALYSIS; LABELED TREES; PATTERN DISCOVERY; PERMUTATION PATTERNS; WHOLE GENOME ANALYSIS;

GENETIC ENGINEERING;

EID: 33750249784     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11851561_35     Document Type: Conference Paper

References (14)

1. M. Alexandersson, S. Cawley, and L. Pachter. SLAM - Cross-species gene finding and alignment with a generalized pair hidden markov model. Genome Research, 13:496-502, 2003.
2. A.V. Aho, J.E. Hopcroft, and J.D. Ullman. Data Structure and Algorithms. Addison-Wesley Publishing Company, 1983.
3. A. Bergeron, C. Chauve, F. de Montgolfier, and M. Raffinot. Computing common intervals of k permutations, with applications to modular decomposition of graphs. Proc. 9th European Symp. on Algorithms ESA '05, volume 3669 of Lecture Notes in Computer Science, pages 779-790, Springer Verlag, 2005.
4. N. Bray, O. Couronne, I. Dubchak, T. Ishkhanov, L. Pachter, A. Poliakov, E. Rubin, and D. Ryaboy. Strategies and tools for whole-genome alignments. Genome Research, 1:73-80, 2003.
5. A. Bergeron, S. Corteel, and M. Raffinot. The algorithmic of gene teams. Proc. 2nd Workshop on Algorithms in Bioinformatics WABI'02, volume 2452 of Lecture Notes in Computer Science, pages 464-476. Springer Verlag, 2002.
6. M.E. Cosner, R.K. Jansen, B.M.E. Moret, L.A. Raubeson, L.-S. Wang, T. Warnow, and S. Wyman. An empirical comparison of phylogenetic methods on chloroplast gene order data in Campanulaceae. Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families, Kluwer, 2000.
7. R. Eres, G. Landau, and L. Parida. A combinatorial approach to automatic discovery of cluster-patterns. Proc. 3rd Workshop on Algorithms in Bioinformatics WABI'03, volume 2812 of Lecture Notes in Bioinformatics, pages 139-150. Springer Verlag, 2003.
8. X. He and M.H. Goldwasser. Identifying conserved gene clusters in the presence of orthologous groups. Proc. 8th Conf. on Research in Computational Molecular Biology RECOMB'04, pages 272-280. ACM Press, 2004.
9. S. Heber and J. Stoye. Finding all common intervals of k permutations. Proc. 12th Symp. on Combinatorial Pattern Matching CPM'01, volume 2089 of Lecture Notes in Computer Science, pages 207-218. Springer Verlag, 2001.
10. K. Booth and G. Leukar. Testing for the consecutive ones property, interval graphs, and graph planarity using pq-tree algorithms. J. of Computer and System Sciences, 13:335-379, 1976.
11. Gad Landau, Laxmi Parida, and Oren Weimann. Using pq trees for comparative genomics. In Proc. Symp. on Combinatorial Pattern Matching CPM'05, volume 3537 of Lecture Notes in Computer Science, pages 128-143. Springer Verlag, 2005.
12. J. Mulley and P. Holland. Small genome, big insights. Nature, 431:916-917, 2004.
13. T. Schmidt and J. Stoye. Quadratic time algorithms for finding common intervals in two and more sequences. In Proc. Symp. on Combinatorial Pattern Matching CPM'04, volume 3109 of Lecture Notes in Computer Science, pages 347-358. Springer Verlag, 2004.
14. T. Uno and M. Yagiura. Fast algorithms to enumerate all common intervals of two permutations. Algorithmica, 26(2):290-309, 2000.