Results 141 to 150 of about 301,848 (186)

PLA-index: A <i>k</i>-mer Index Exploiting Rank Curve Linearity. [PDF]

Algorithms Bioinform
Abrar H, Medvedev P.
europepmc   +1 more source

Effective primer design for genotype and subtype detection of highly divergent viruses in large scale genome datasets. [PDF]

BMC Bioinformatics
Demiralay B, Can T.
europepmc   +1 more source

Finishing a complete giraffe genome from telomere to telomere with Verkko-Fillet. [PDF]

Cell Genom
Kim J, Rosen BD, Fumagalli SE, Kuhn KL, Long A, Schoenebeck JJ, Schwartz H, Wu-Cavener L, Zimin AV, Cavener DR, Smith TPL, Phillippy AM, Koren S, Rhie A.   +13 more
europepmc   +1 more source

Evaluating the autoantibody reactome in giant cell arteritis

Porteous M, Maughan RT, Sorensen L, Zulcinski M, Aslam A, Mackie SL, Pericleous C, Tomlinson J, Luqmani RA, Pickering MC, Morgan AW, Peters JE.   +11 more
europepmc   +1 more source

Computing Quasi Suffix Arrays

J. Autom. Lang. Comb., 2003
We introduce quasi suffix arrays as a generalization of suffix arrays for character strings. We show that a quasi suffix array encodes enough of the structure of the string to be a useful construct for many applications where the full power of suffix arrays is not necessary, notably in problems that do not require lexicographical order, for example ...
Frantisek Franek, Jan Holub 0001, William F. Smyth, Xiangdong Xiao   +3 more
openaire   +3 more sources

Suffix Arrays on Words

, 2007
Surprisingly enough, it is not yet known how to build directly a suffix array that indexes just the k positions at word-boundaries of a text T[1, n], taking O(n) time and O(k) space in addition to T. We propose a class-note solution to this problem that achieves such optimal time and space bounds.
FERRAGINA, PAOLO, FISCHER J.
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Computing suffix links for suffix trees and arrays

Information Processing Letters, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly   +4 more sources

Constructing suffix arrays in linear time [PDF]

Journal of Discrete Algorithms, 2005
The time complexity of suffix tree construction has been shown to be equivalent to that of sorting: O(n) for a constant-size alphabet or an integer alphabet and O(nlogn) for a general alphabet.
Kunsoo Park, Jeong Seop Sim, Heejin Park   +2 more
exaly   +2 more sources

Distributed text search using suffix arrays [PDF]

Parallel Computing, 2014
Text search is a classical problem in Computer Science, with many data-intensive applications. For this problem, suffix arrays are among the most widely known and used data structures, enabling fast searches for phrases, terms, substrings and regular ...
G Navarro, Diego Arroyuelo, Veronica Gil-Costa   +2 more
exaly   +2 more sources

Generalizations of suffix arrays to multi-dimensional matrices [PDF]

Theoretical Computer Science, 2003
We propose multi-dimensional index data structures that generalize suffix arrays to square matrices and cubic matrices. Giancarlo proposed a two-dimensional index data structure, the Lsuffix tree, that generalizes suffix trees to square matrices. However,
Kunsoo Park, Dong Kyue Kim
exaly   +2 more sources