✦ LIBER ✦

Efficient algorithms for inferring evolutionary trees

✍ Scribed by Dan Gusfield

Publisher: John Wiley and Sons
Year: 1991
Tongue: English
Weight: 547 KB
Volume: 21
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230210104

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tree Compatibility and Inferring Evoluti

Tree Compatibility and Inferring Evolutionary History

✍ T.J. Warnow 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 878 KB

Algorithms for inferring haplotypes

✍ Tianhua Niu 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 411 KB

## Abstract Haplotype phase information in diploid organisms provides valuable information on human evolutionary history and may lead to the development of more efficient strategies to identify genetic variants that increase susceptibility to human diseases. Molecular haplotyping methods are labor‐

Efficient algorithms for generalized cut

Efficient algorithms for generalized cut-trees

✍ Dan Gusfield; Dalit Naor 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 872 KB

A combinatorial description of the close

A combinatorial description of the closest tree algorithm for finding evolutionary trees

✍ Michael D. Hendy 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 382 KB

The closest tree algorith¢a for estimating the evolutionary history of n species, from a set of homologous DNA or RNA sequences is designed to avoid the problem of inconsistency inherent in current methods. The algorithm, as previously described, required O(n~2 n) steps, making it impractical for va

Efficient Merging and Construction of Ev

Efficient Merging and Construction of Evolutionary Trees

✍ Andrzej Lingas; Hans Olsson; Anna Östlin 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 99 KB

In this paper we study the algorithmic problem of constructing rooted evolutionary trees in the so-called experiment model. This model was first presented by Ž Ž . .

More Efficient Algorithm for Ordered Tre

More Efficient Algorithm for Ordered Tree Inclusion

✍ Weimin Chen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 221 KB

Given two ordered trees S S and T T, the tree inclusion problem is to determine whether it is possible to obtain S S from T T by deleting nodes. Recently, this problem has been recognized as an important primitive in query processing for Ž< Ž .< < <. structured text databases. In this paper we prese