Sciweavers

2930 search results - page 414 / 586
» The optimal sequence compression
Sort
View
CIKM
2008
Springer
15 years 8 months ago
TinyLex: static n-gram index pruning with perfect recall
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
Derrick Coetzee
NIPS
2004
15 years 7 months ago
Multiple Alignment of Continuous Time Series
Multiple realizations of continuous-valued time series from a stochastic process often contain systematic variations in rate and amplitude. To leverage the information contained i...
Jennifer Listgarten, Radford M. Neal, Sam T. Rowei...
BMCBI
2008
103views more  BMCBI 2008»
15 years 6 months ago
TOPS++FATCAT: Fast flexible structural alignment using constraints derived from TOPS+ Strings Model
Background: Protein structure analysis and comparison are major challenges in structural bioinformatics. Despite the existence of many tools and algorithms, very few of them have ...
Mallika Veeramalai, Yuzhen Ye, Adam Godzik
TIT
2008
72views more  TIT 2008»
15 years 6 months ago
On the Construction of (Explicit) Khodak's Code and Its Analysis
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In 1972 Khodak claimed to provide upper and lower bounds for the achievable redund...
Yann Bugeaud, Michael Drmota, Wojciech Szpankowski
BMCBI
2004
115views more  BMCBI 2004»
15 years 6 months ago
An SVD-based comparison of nine whole eukaryotic genomes supports a coelomate rather than ecdysozoan lineage
Background: Eukaryotic whole genome sequences are accumulating at an impressive rate. Effective methods for comparing multiple whole eukaryotic genomes on a large scale are needed...
Gary W. Stuart, Michael W. Berry