142 search results - page 10 / 29 » Matrix Trees |
130
Voted
DMIN
2006
15 years 3 months ago
2006
Common document clustering algorithms utilize models that either divide a corpus into smaller clusters or gather individual documents into clusters. Hierarchical Agglomerative Clus...
123
click to vote
WABI
2010
Springer
15 years 6 days ago
2010
Springer
Although many supertree methods have been developed in the last few decades, none has been shown to produce more accurate trees than the popular Matrix Representation with Parsimon...
156
click to vote
BMCBI
2011
14 years 8 months ago
2011
Background: Phylogenetic trees are an important tool for representing evolutionary relationships among organisms. In a phylogram or chronogram, the ordering of taxa is not conside...
248
Voted
VLDB
2002
ACM
16 years 2 months ago
2002
ACM
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
126
click to vote
FSTTCS
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. We describe some new, simple and apparently general methods for designing FPT algorithms, and illustrate how these can be used to obtain a signi cantly improved FPT algor...