Using permutation patterns for content-based phylogeny

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

Volumn 4146 LNBI, Issue , 2006, Pages 115-125

  Karim, Md Enamul ^a   Parida, Laxmi ^b   Lakhotia, Arun ^a  

^a University of Louisiana at Lafayette   (United States)

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

Author keywords

[No Author keywords available]

Indexed keywords

CHROMOSOMES; COMPUTER VIRUSES; CONTENT BASED RETRIEVAL; FUNCTION EVALUATION; GENES; POLYNOMIALS;

CHLOROPLAST; PERMUTATION PATTERNS; PHYLOGENY; POLYNOMIAL TIME;

GENETIC ENGINEERING;

EID: 33750050861     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11818564_13     Document Type: Conference Paper

References (16)

1. Kececioglu, J. and Sankoff, D.(1994) Efficient bounds for oriented chromosome inversion distance. 5th Annual Symposium on Combinatorial Pattern Matching CPM, 807 307-325
2. Blanchette, M., Bourque, G. and Sankoff, D. (1997) Breakpoint phylogenies. In Genome Informatics Workshop (GIW 1997), (eds. S. Miyano and T. Takagi), pp. 25-34. University Academy Press, Tokyo.
3. Bourque, G. and Pevzner, P. A.(2002) Genome-Scale Evolution: Reconstructing Gene Orders in the Ancestral Species. Genome Research, 12(1): 26-36, Cold Spring Harbor Laboratory Press
4. Caprara, A. (1999) Formulations and complexity of multiple sorting by reversals. Proceedings of the Third Annual International Conference on Computational Molecular Biology RECOMB, (eds. S. Istrail et al.), pp. 8493. ACM Press, Lyon, France.
5. Cosner, M. E. et. al. (2000) 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, D. Sankoff and J. Nadeau, eds., 99-121, Kluwer Academic Publishers
6. Eres R., Landau, G. M. and Parida, L. (2003) Combinatorial approach to automatic discovery of cluster patterns. Algorithms in Bioinformatics: Third International Workshop, WABI, Budapest, Hungary, WABI, pp. 139-150, Springer-Verlag
7. Kauffman, L. and Rousseeuw, P. (1990) Finding Groups in Data: An Introduction to Cluster Analysis
8. Landau, G. M., Parida, L. and Weimann, O. (2005) Using PQ Trees for Comparative Genomics. Combinatorial Pattern Matching, CPM, Jeju Island, South Korea, CPM, pp. 128-143, Springer-Verlag
9. Karim, M. E., Walenstein, A., Lakhotia, A. and Parida, L. (2005) Malware phylogeny generation using permutations of code. European Journal of Computer Virology 11-11
10. Nadeau, J. and Taylor, B. (1984) Lengths of chromosomal segments conserved since divergence of man and mouse. Proc. Natl.Acad. Sci. PNAS 81 814-818
11. Watterson, G., Ewens, W., Hall, T. and Morgan, A. (1982) The chromosome inversion problem. J. Theor. Biol. 99 1-7
12. Peer, I. and Shamir, R. (1998) The median problems for breakpoints are NP-complete, Electronic. Colloquium on Computational Complexity Technical Report 98-071, http://www.eccc.uni-trier.de/eccc.
13. Hannenhalli, S. and Pevzner, P. (1995) Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). Proc. of the 27th Annual Symposium on Theory of Computing STOC, 178189
14. Sankoff, D. (1992) Edit distance for genome comparison based on non-local operations. Proc of the 3rd Annual Symposium on Combinatorial Pattern Matching CPM, 121-135
15. Berman, P. and Hannenhalli, S.(1996) Fast sorting by reversal. 7th Annual Symposium on Combinatorial Pattern Matching CPM, 1075 168-185
16. Kaplan, H., Shamir, R. and Tarjan,R. (1997) Faster and simpler algorithm for sorting signed per- mutations by reversals. Proc of the 8th Annual ACM-SIAM Symposium onDiscrete Algorithms SODA, 344-351