Sciweavers

240 search results - page 9 / 48
» On Efficient Construction of Decision Trees from Large Datab...
Sort
View
BMCBI
2005
100views more  BMCBI 2005»
13 years 7 months ago
EvDTree: structure-dependent substitution profiles based on decision tree classification of 3D environments
Background: Structure-dependent substitution matrices increase the accuracy of sequence alignments when the 3D structure of one sequence is known, and are successful e.g. in fold ...
Jean-Christophe Gelly, Laurent Chiche, Jér&...
ALGORITHMICA
2006
163views more  ALGORITHMICA 2006»
13 years 7 months ago
Building Large Phylogenetic Trees on Coarse-Grained Parallel Machines
Phylogenetic analysis is an area of computational biology concerned with the reconstruction of evolutionary relationships between organisms, genes, and gene families. Maximum likel...
Thomas M. Keane, Andrew J. Page, Thomas J. Naughto...
JACM
2006
112views more  JACM 2006»
13 years 7 months ago
Linear work suffix array construction
Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity an...
Juha Kärkkäinen, Peter Sanders, Stefan B...
IPPS
1999
IEEE
13 years 11 months ago
Parallel Out-of-Core Divide-and-Conquer Techniques with Application to Classification Trees
Classification is an important problem in the field of data mining. Construction of good classifiers is computationally intensive and offers plenty of scope for parallelization. D...
Mahesh K. Sreenivas, Khaled Alsabti, Sanjay Ranka
COLING
1996
13 years 8 months ago
Error-tolerant Tree Matching
This paper presents an efficient algorithm for retrieving from a database of trees, all trees that match a given query tree appro,imately, that is, within a certain error toleranc...
Kemal Oflazer