56 search results - page 8 / 12 » K-Best Suffix Arrays |
100
click to vote
IJSI
2008
14 years 10 months ago
2008
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...
101
click to vote
FOCS
2009
IEEE
15 years 1 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
IPL
2008
14 years 10 months ago
2008
We give two optimal linear-time algorithms for computing the Longest Previous Factor (LPF) array corresponding to a string w. For any position i in w, LPF[i] gives the length of th...
110
click to vote
SIGSOFT
2007
ACM
15 years 10 months ago
2007
ACM
Code clones are similar code fragments that occur at multiple locations in a software system. Detection of code clones provides useful information for maintenance, reengineering, ...
BIRD
2007
Springer
15 years 4 months ago
2007
Springer
We investigate indexing techniques for sequence data, crucial in a wide variety of applications, where efficient, scalable, and versatile search algorithms are required. Recent res...