7 search results - page 1 / 2 » On the longest path algorithm for reconstructing trees from ... |
IPL
2007
13 years 4 months ago
2007
Culberson and Rudnicki [1] gave an algorithm that reconstructs a degree d restricted tree from its distance matrix. According to their analysis, it runs in time O(dn logd n) for t...
BMCBI
2006
13 years 4 months ago
2006
Background: Phylogenetic methods which do not rely on multiple sequence alignments are important tools in inferring trees directly from completely sequenced genomes. Here, we exte...
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....
ALGORITHMICA
1999
13 years 4 months ago
1999
Sequence data for a group of species is often summarized by a distance matrix M where M[s, t] is the dissimilarity between the sequences of species s and t. An ordinal assertion is...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
Abstract—Phylogenetic networks are a generalization of phylogenetic trees that allow for the representation of non-treelike evolutionary events, like recombination, hybridization...