A greedy algorithm for optimal recombination

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

Volumn 2108, Issue , 2001, Pages 86-90

  Wu, Shiquan ^a   Gu, Xun ^a  

^a IOWA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EVOLUTIONARY HISTORY; GREEDY ALGORITHMS;

TREES (MATHEMATICS);

EID: 23044529253     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44679-6_10     Document Type: Conference Paper

References (6)

1. Durbin, R., Eddy, S. R., Krogh, A. and Mitchison, G., 1998. Biological sequence analysis: Probabilistic models of proteins and nucleic acids,. Cambridge University Press.
2. Gusfield, D., 1997. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press.
3. Hein, J., 1990. Reconstruct evolution of sequences subject to recombination, Mathematical biosciences 98:185-200.
4. Hein, J., 1993. A heuristic method to reconstruct the history of sequences subject to recombination, Journal of Molecular Evolution 36: 396-450.
5. Kececioglu, J. and Gusfield, D., 1994. Reconstructing a history of recombinations from a set of sequences, 5th Annual ACM-SIAM Symposium on Discrete Algorithm Arlington, Virginia, pp.471-480. Also in Discrete Applied Mathematics 88(1998)239-260.
6. Wang, L., B. Ma and M. Li, 2000, Fixed topology alignment with recombination, Discrete Applied Mathematics 104: 281-300