Morgenstern, B., Stoye, J., and Dress, A. W. M. 1999. Consistent equivalence relations: a set-theoretical framework for multiple sequence alignment. Technical Report Materialien und Preprints 133, University of Bielefeld. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Algorithms and Experiments on Transitive Closure, Path Cover and .. - Abdeddaim (2000) (Correct)
....can be reduced to a smaller problem on an acyclic graph in linear time by shrinking strongly connected components. 3. MULTIPLE SEQUENCE ALIGNMENT AND TRANSITIVE CLOSURE 3. 1 Greedy multiple alignment algorithms The following de nitions are due to Morgenstern et al. Morgenstern et al. 1996; Morgenstern et al. 1999]. Let S = fS 1 ; S k g be a sequence family and let X be the set of all sites of S where a site x = i; p) represents the p th position in the i th sequence. We denote by the linear order between sites of the same sequences, i; p) j; q) if and only if i = j and p q. Every binary ....
Morgenstern, B., Stoye, J., and Dress, A. W. M. 1999. Consistent equivalence relations: a set-theoretical framework for multiple sequence alignment. Technical Report Materialien und Preprints 133, University of Bielefeld.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC