10 search results - page 2 / 2 » A Linear-Time Burrows-Wheeler Transform Using Induced Sortin... |
CCP
2011
12 years 4 months ago
2011
—The Burrows-Wheeler Transform (BWT) is the basis for many of the most effective compression and selfindexing methods used today. A key to the versatility of the BWT is the abili...
DCC
2009
IEEE
14 years 5 months ago
2009
IEEE
We present a linear time and space suffix array (SA) construction algorithm called the SA-IS algorithm. The SA-IS algorithm is novel because of the LMS-substrings used for the pro...
COMBINATORICS
2007
13 years 4 months ago
2007
In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computationa...
RECOMB
2007
Springer
14 years 5 months ago
2007
Springer
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
WSDM
2009
ACM
13 years 11 months ago
2009
ACM
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...