Sciweavers

773 search results - page 16 / 155
» Suffix Trees on Words
Sort
View
JMLR
2008
148views more  JMLR 2008»
15 years 1 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov
111
Voted
ACL
2009
14 years 11 months ago
Modeling Morphologically Rich Languages Using Split Words and Unstructured Dependencies
We experiment with splitting words into their stem and suffix components for modeling morphologically rich languages. We show that using a morphological analyzer and disambiguator...
Deniz Yuret, Ergun Biçici
RECOMB
2005
Springer
16 years 2 months ago
Information Theoretic Approaches to Whole Genome Phylogenies
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
David Burstein, Igor Ulitsky, Tamir Tuller, Benny ...
146
Voted
JCB
2006
124views more  JCB 2006»
15 years 1 months ago
The Average Common Substring Approach to Phylogenomic Reconstruction
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
Igor Ulitsky, David Burstein, Tamir Tuller, Benny ...
CORR
2002
Springer
82views Education» more  CORR 2002»
15 years 1 months ago
Using eigenvectors of the bigram graph to infer morpheme identity
This paper describes the results of some experiments exploring statistical methods to infer syntactic categories from a raw corpus in an unsupervised fashion. It shares certain po...
Mikhail Belkin, John A. Goldsmith