Sciweavers

223 search results - page 4 / 45
» Suffix Arrays on Words
Sort
View
ICML
2006
IEEE
14 years 7 months ago
Fast and space efficient string kernels using suffix arrays
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
Choon Hui Teo, S. V. N. Vishwanathan
CPM
2009
Springer
183views Combinatorics» more  CPM 2009»
13 years 4 months ago
Permuted Longest-Common-Prefix Array
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...
Juha Kärkkäinen, Giovanni Manzini, Simon...
CIKM
2009
Springer
13 years 10 months ago
Robust record linkage blocking using suffix arrays
Record linkage is an important data integration task that has many practical uses for matching, merging and duplicate removal in large and diverse databases. However, a quadratic ...
Timothy de Vries, Hui Ke, Sanjay Chawla, Peter Chr...
BMCBI
2008
128views more  BMCBI 2008»
13 years 6 months ago
Efficient computation of absent words in genomic sequences
Background: Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon us...
Julia Herold, Stefan Kurtz, Robert Giegerich
IJSI
2008
115views more  IJSI 2008»
13 years 6 months ago
Towards Knowledge Acquisition from Semi-Structured Content
Abstract A rich family of generic Information Extraction (IE) techniques have been developed by researchers nowadays. This paper proposes WebKER, a system for automatically extract...
Xi Bai, Jigui Sun, Haiyan Che, Lian Shi