Abstract
Let Σ be an alphabet and Σn denote the collection of all sequences of length n over Σ. For any s1 = a1a2...ajaj+1...an, s2= b1b2...bj bj+1...bn € Sn, a recombination of s1 and s2 at position j is de?ned as an operation that crosses s1 and s2 at position j and generates t1=a1a2...ajbj+1...bn and t2=b1b2...bjaj+1... an. Denote A and S two collections of sequences. In this paper, we discuss generating A from S by a series of recombinations in minimum number of steps. We present a greedy algorithm for ?nding the optimal recombination evolutionary history from S to any tree A of sequences when |S|=2.
Research supported in part by NIH Grant RO1 GM62118 (to X.G.) and NSF of China (19771025). Wu is on leave from Math Dept,N.U.D.T.,Hunan 410073,China.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Durbin, R., Eddy, S.R., Krogh, A. and Mitchison, G., 1998. Biological sequence analysis: Probabilistic models of proteins and nucleic acids,. Cambridge University Press.
Gusfield, D., 1997. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press.
Hein, J., 1990. Reconstruct evolution of sequences subject to recombination,Mathematical biosciences 98:185–200.
Hein, J., 1993. A heuristic method to reconstruct the history of sequences subject to recombination, Journal of Molecular Evolution 36: 396–450.
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.
Wang, L., B. Ma and M. Li, 2000, Fixed topology alignment with recombination, Discrete Applied Mathematics 104: 281–300
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, S., Gu, X. (2001). A Greedy Algorithm for Optimal Recombination. In: Wang, J. (eds) Computing and Combinatorics. COCOON 2001. Lecture Notes in Computer Science, vol 2108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44679-6_10
Download citation
DOI: https://doi.org/10.1007/3-540-44679-6_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42494-9
Online ISBN: 978-3-540-44679-8
eBook Packages: Springer Book Archive