773 search results - page 8 / 155 » Suffix Trees on Words |
115
click to vote
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
Given string T = T[1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T[i, . . . , n] for all i. This problem is central to the construction of suf...
CIKM
2008
Springer
15 years 1 months ago
2008
Springer
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...
100
click to vote
DL
2000
Springer
15 years 4 months ago
2000
Springer
In this paper we introduce the MatchDetectReveal(MDR) system, which is capable of identifying overlapping and plagiarised documents. Each component of the system is briefly descri...
85
Voted
ACL
2010
14 years 9 months ago
2010
Factored Statistical Machine Translation extends the Phrase Based SMT model by allowing each word to be a vector of factors. Experiments have shown effectiveness of many factors, ...
CAI
2009
Springer
15 years 6 months ago
2009
Springer
