Results 21 to 30 of about 3,800 (211)
Statistical signature of subtle behavioral changes in large-scale assays. [PDF]
PLoS Computational BiologyThe central nervous system can generate various behaviors, including motor responses, which we can observe through video recordings. Recent advances in gene manipulation, automated behavioral acquisition at scale, and machine learning enable us to ...
Alexandre Blanc +12 more
doaj +2 more sources
A tight upper bound on the size of the antidictionary of a binary string [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A tight upper bound of the size of the antidictionary of a binary string is presented. And it is shown that the size of the antidictionary of a binary sting is always smaller than or equal to that of its dictionary.
Hiroyoshi Morita, Takahiro Ota
doaj +1 more source
Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees
Algorithms, 2021 We present algorithms computing the non-overlapping Lempel–Ziv-77 factorization and the longest previous non-overlapping factor table within small space in linear or near-linear time with the help of modern suffix tree representations fitting into ...
Dominik Köppl
doaj +1 more source
On the Number of 2-Protected Nodes in Tries and Suffix Trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We use probabilistic and combinatorial tools on strings to discover the average number of 2-protected nodes in tries and in suffix trees. Our analysis covers both the uniform and non-uniform cases.
Jeffrey Gaither +3 more
doaj +1 more source
On Suffix Extensions in Suffix Trees
Theoretical Computer Science, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Breslauer D, Italiano G
openaire +6 more sources
Suffix-Sorting via Shannon-Fano-Elias Codes
Algorithms, 2010 Given a sequence T = t0t1 . . . tn-1 of size n = |T|, with symbols from a fixed alphabet Σ, (|Σ| ≤ n), the suffix array provides a listing of all the suffixes of T in a lexicographic order.
Donald Adjeroh, Fei Nan
doaj +1 more source
Fast Hybrid Data Structure for a Large Alphabet K-Mers Indexing for Whole Genome Alignment
IEEE Access, 2021 The most common index data structures used by whole genome aligners (WGA) are based on suffix trees (ST), suffix arrays, and FM-indexes. These data structures show good performance results as WGA works with sequences of letters over small alphabets; for ...
Rostislav Hrivnak +2 more
doaj +1 more source
Subpath Queries on Compressed Graphs: A Survey
Algorithms, 2021 Text indexing is a classical algorithmic problem that has been studied for over four decades: given a text T, pre-process it off-line so that, later, we can quickly count and locate the occurrences of any string (the query pattern) in T in time ...
Nicola Prezza
doaj +1 more source
The suffix binary search tree and suffix AVL tree
Journal of Discrete Algorithms, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Robert W. Irving, Lorna Love
openaire +1 more source
, 2017 The suffix tree—the compacted trie of all the suffixes of a string—is the most important and widely-used data structure in string processing. We consider a natural combinatorial question about suffix trees: for a string S of length n, how many nodes νS(d) can there be at (string) depth d in its suffix tree? We prove ν(n,d)=maxS∈ΣnνS(d) is O((n/d)logn) ,
Golnaz Badkobeh +3 more
openaire +2 more sources