142 search results - page 4 / 29 » Matrix Trees |
154
Voted
MFCS
2005
Springer
15 years 11 months ago
2005
Springer
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...
151
click to vote
ICMCS
2009
IEEE
15 years 3 months ago
2009
IEEE
This paper presents an efficient way to construct the self-similarity matrix, a popular approach, to detect repeating segments in music. Our proposed method extends the sparse suf...
166
click to vote
STACS
1999
Springer
15 years 10 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
169
Voted
ALGORITHMICA
1999
15 years 5 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...
187
Voted
EUROPAR
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. Definitions for the uniform representation of d-dimensional matrices serially in Morton-order (or Z-order) support both their use with cartesian indices, and their divide...