Indexing highly repetitive string collections, part II: Compressed indexes
G Navarro - ACM Computing Surveys (CSUR), 2021 - dl.acm.org
Two decades ago, a breakthrough in indexing string collections made it possible to
represent them within their compressed space while at the same time offering indexed …
represent them within their compressed space while at the same time offering indexed …
Prediction of protein function from protein sequence and structure
JC Whisstock, AM Lesk - Quarterly reviews of biophysics, 2003 - cambridge.org
1. Introduction 3082. Plan of this article 3123. Natural mechanisms of development of novel
protein functions 3133.1 Divergence 3133.2 Recruitment 3163.3 'Mixing and matching'of …
protein functions 3133.1 Divergence 3133.2 Recruitment 3163.3 'Mixing and matching'of …
[LIBRO][B] Modern information retrieval
R Baeza-Yates, B Ribeiro-Neto - 1999 - people.ischool.berkeley.edu
Information retrieval (IR) has changed considerably in recent years with the expansion of the
World Wide Web and the advent of modern and inexpensive graphical user interfaces and …
World Wide Web and the advent of modern and inexpensive graphical user interfaces and …
[LIBRO][B] The algorithm design manual
SS Skiena - 1998 - Springer
This newly expanded and updated second edition of the best-selling classic continues to
take the" mystery" out of designing algorithms, and analyzing their efficacy and efficiency …
take the" mystery" out of designing algorithms, and analyzing their efficacy and efficiency …
[LIBRO][B] Natural language processing for historical texts
M Piotrowski - 2012 - books.google.com
More and more historical texts are becoming available in digital form. Digitization of paper
documents is motivated by the aim of preserving cultural heritage and making it more …
documents is motivated by the aim of preserving cultural heritage and making it more …
Linear work suffix array construction
Suffix trees and suffix arrays are widely used and largely interchangeable index structures
on strings and sequences. Practitioners prefer suffix arrays due to their simplicity and space …
on strings and sequences. Practitioners prefer suffix arrays due to their simplicity and space …
[LIBRO][B] Algorithms and theory of computation handbook, volume 2: special topics and techniques
MJ Atallah, M Blanton - 2009 - books.google.com
This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …
topics, techniques, and applications. Along with updating and revising many of the existing …
[LIBRO][B] Computer science handbook
AB Tucker - 2004 - taylorfrancis.com
When you think about how far and fast computer science has progressed in recent years, it's
not hard to conclude that a seven-year old handbook may fall a little short of the kind of …
not hard to conclude that a seven-year old handbook may fall a little short of the kind of …
[LIBRO][B] Handbook of data structures and applications
Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …
until now there was no book that focused exclusively on the wide variety of data structures …
[LIBRO][B] Genome-scale algorithm design
High-throughput sequencing has revolutionised the field of biological sequence analysis. Its
application has enabled researchers to address important biological questions, often for the …
application has enabled researchers to address important biological questions, often for the …