Abstract
A framework is outlined to study the evolution of DNA or amino acid sequences, if sequence sites do not evolve independently. The units of evolution are nonoverlapping subsequences of length l. Each subsequence evolves independently of the others, but within a subsequence the sequences show a Markov order one dependency. We describe an algorithm to mimic the evolution of such sequences. The influence of dependencies between sites on distance estimates and the reliability of tree reconstruction methods is investigated. We show that an inappropriate model of sequence evolution in the tree reconstruction process will lead to a nonempty Felsenstein zone. Finally, we describe a method to infer l from sequence data. Examples from the evolution of DNA sequences as well as from amino acids are given.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
