Sciweavers

SIAMJO
2010
110views more  SIAMJO 2010»
13 years 6 months ago
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinit
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
Hans D. Mittelmann, Jiming Peng
ALGORITHMICA
1999
99views more  ALGORITHMICA 1999»
13 years 11 months ago
Evolutionary Trees and Ordinal Assertions
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...
Paul E. Kearney, Ryan Hayward, Henk Meijer
ENDM
2002
84views more  ENDM 2002»
13 years 11 months ago
Addressing the Petersen graph
Motivated by a problem on message routing in communication networks, Graham and Pollak proposed a scheme for addressing the vertices of a graph G by N-tuples of three symbols in s...
Randall J. Elzinga, David A. Gregory, Kevin N. Van...
BMCBI
2004
150views more  BMCBI 2004»
13 years 11 months ago
Inter-residue distances derived from fold contact propensities correlate with evolutionary substitution costs
Background: The wealth of information on protein structure has led to a variety of statistical analyses of the role played by individual amino acid types in the protein fold. In p...
Gareth Williams, Patrick Doherty
IPL
2007
89views more  IPL 2007»
13 years 11 months ago
On the longest path algorithm for reconstructing trees from distance matrices
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...
Lev Reyzin, Nikhil Srivastava
BMCBI
2007
138views more  BMCBI 2007»
13 years 11 months ago
Fast computation of distance estimators
Background: Some distance methods are among the most commonly used methods for reconstructing phylogenetic trees from sequence data. The input to a distance method is a distance m...
Isaac Elias, Jens Lagergren
BMCBI
2010
135views more  BMCBI 2010»
13 years 11 months ago
MrsRF: an efficient MapReduce algorithm for analyzing large collections of evolutionary trees
Background: MapReduce is a parallel framework that has been used effectively to design largescale parallel applications for large computing clusters. In this paper, we evaluate th...
Suzanne Matthews, Tiffani L. Williams
ESA
2008
Springer
106views Algorithms» more  ESA 2008»
14 years 1 months ago
An Experimental Analysis of Robinson-Foulds Distance Matrix Algorithms
In this paper, we study two fast algorithms--HashRF and PGM-Hashed--for computing the Robinson-Foulds (RF) distance matrix between a collection of evolutionary trees. The RF distan...
Seung-Jin Sul, Tiffani L. Williams
FOCS
2004
IEEE
14 years 3 months ago
Triangulation and Embedding Using Small Sets of Beacons
Concurrent with recent theoretical interest in the problem of metric embedding, a growing body of research in the networking community has studied the distance matrix defined by n...
Jon M. Kleinberg, Aleksandrs Slivkins, Tom Wexler
MFCS
2005
Springer
14 years 5 months ago
Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix
Abstract. Given a distance matrix M that specifies the pairwise evolutionary distances between n species, the phylogenetic tree reconstruction problem asks for an edge-weighted ph...
Ho-Leung Chan, Jesper Jansson, Tak Wah Lam, Siu-Mi...