X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (141) 141
Conference Proceeding (70) 70
Newspaper Article (38) 38
Book Chapter (13) 13
Publication (11) 11
Book / eBook (3) 3
Dissertation (3) 3
Book Review (1) 1
Magazine Article (1) 1
Reference (1) 1
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
computer science - data structures and algorithms (74) 74
computer science (40) 40
algorithms (26) 26
data compression (25) 25
data structures (23) 23
algorithm analysis and problem complexity (17) 17
computer science, theory & methods (14) 14
computer science, information systems (10) 10
discrete mathematics in computer science (10) 10
algorithm (9) 9
bioinformatics (8) 8
indexes (8) 8
mathematics, applied (8) 8
computer communication networks (7) 7
computer science, software engineering (7) 7
arrays (6) 6
burrows-wheeler transform (6) 6
encoding (6) 6
entropy (6) 6
indexing (6) 6
numeric computing (6) 6
pattern matching (6) 6
pattern recognition (6) 6
strings (6) 6
theoretical computer science (6) 6
computation by abstract devices (5) 5
computational biology/bioinformatics (5) 5
data mining and knowledge discovery (5) 5
databases (5) 5
huffman codes (5) 5
information retrieval (5) 5
laws, regulations and rules (5) 5
redundancy (5) 5
studies (5) 5
biochemical research methods (4) 4
compact data structures (4) 4
compressed data structures (4) 4
compression (4) 4
computer science - information theory (4) 4
data mining (4) 4
datenstruktur (4) 4
genomes (4) 4
genomic databases (4) 4
genomics (4) 4
graphs (4) 4
information storage and retrieval (4) 4
mathematics (4) 4
string algorithms (4) 4
analysis (3) 3
approximate pattern matching (3) 3
biotechnology & applied microbiology (3) 3
bounds (3) 3
burrows–wheeler transform (3) 3
communication (3) 3
compressed (3) 3
compressed text (3) 3
computational theory and mathematics (3) 3
computer graphics (3) 3
computer science - information retrieval (3) 3
computer software (3) 3
computer systems organization and communication networks (3) 3
corporation law (3) 3
data structures, cryptology and information theory (3) 3
discrete mathematics and combinatorics (3) 3
efficient algorithms (3) 3
electronic books (3) 3
empirical entropy (3) 3
genom (3) 3
huffman coding (3) 3
index medicus (3) 3
information systems applications (3) 3
interpretation and construction (3) 3
lz77 (3) 3
mathematical & computational biology (3) 3
mathematical analysis (3) 3
mathematical-theory (3) 3
mathematics of computing (3) 3
on-line algorithms (3) 3
protocols (3) 3
software, computer (3) 3
space (3) 3
suffix arrays (3) 3
theory of computation (3) 3
vegetation (3) 3
wavelet trees (3) 3
1d range queries (2) 2
alphabet (2) 2
analysis of algorithms (2) 2
análisis combinatorio (2) 2
artificial intelligence (2) 2
asymmetric communication (2) 2
binary-trees (2) 2
bioengineering and biotechnology (2) 2
bwt (2) 2
codes (2) 2
combinatorial analysis (2) 2
complexity (2) 2
complexity, computational (2) 2
compressed text indexing (2) 2
compressing (2) 2
more...
Library Location Library Location
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Journal of Discrete Algorithms, ISSN 1570-8667, 03/2017, Volume 43, pp. 1 - 1
Journal Article
Algorithmica, ISSN 0178-4617, 07/2018, Volume 80, Issue 7, pp. 1983 - 1985
To access, purchase, authenticate, or subscribe to the full-text of this article, please visit this link: http://dx.doi.org/10.1007/s00453-017-0381-6 
COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | Data structures
Journal Article
Software: Practice and Experience, ISSN 0038-0644, 06/2019, Volume 49, Issue 6, pp. 1041 - 1051
Order‐preserving pattern matching has been introduced recently, but it has already attracted much attention. Given a reference sequence and a pattern, we want... 
data compression | compressed indices | order‐preserving matching | order-preserving matching | COMPUTER SCIENCE, SOFTWARE ENGINEERING | ALGORITHM | Pattern analysis | Pattern matching
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 04/2012, Volume 426-427, pp. 25 - 41
Wavelet trees are widely used in the representation of sequences, permutations, text collections, binary relations, discrete points, and other succinct data... 
Document retrieval | Wavelet trees | Information retrieval | Data structures | 1D range queries | SORTED SEQUENCES | RANGE MEDIAN QUERIES | COMPRESSED TEXT | MODE | EFFICIENT ALGORITHMS | REPRESENTATION | DOCUMENT-RETRIEVAL | SPACE | INTERSECTION ALGORITHM | COMPUTER SCIENCE, THEORY & METHODS | INDEXES | Information storage and retrieval | Algorithms
Journal Article
2003, Canadian theses, ISBN 9780612781306
Suppose that S is a string of length m drawn from an alphabet of n characters, d of which occur in S. Let P be the relative frequency distribution of... 
Computer science
Dissertation
Theoretical Computer Science, ISSN 0304-3975, 05/2019, Volume 770, pp. 34 - 50
Let be a function, and indicate a label assigned to each element of the domain. We design several compact data structures that answer various kinds of summary... 
Range queries | Succinct data structures | Integer functions | Trees and permutations | COMPUTER SCIENCE, THEORY & METHODS | SPACE-EFFICIENT | Computer science
Journal Article
IEEE Transactions on Information Theory, ISSN 0018-9448, 09/2015, Volume 61, Issue 9, pp. 4999 - 5011
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 10/2017, Volume 698, pp. 67 - 78
The famous Burrows–Wheeler Transform (BWT) was originally defined for a single string but variations have been developed for sets of strings, labeled trees, de... 
Compressed data structures | Burrows–Wheeler transform | Pattern matching | TREES | COMPRESSED TEXT | WORDS | Burrows-Wheeler transform | TRANSFORM | EXTENSION | COMPUTER SCIENCE, THEORY & METHODS | ALGORITHMS | INDEXES | Analysis | Robots
Journal Article
Bioinformatics, ISSN 1367-4803, 12/2018, Volume 34, Issue 24, pp. 4189 - 4195
Abstract Motivation The de Bruijn graph is fundamental to the analysis of next generation sequencing data and so, as datasets of DNA reads grow rapidly, it... 
BIOTECHNOLOGY & APPLIED MICROBIOLOGY | ALGORITHM | BIOCHEMICAL RESEARCH METHODS | MATHEMATICAL & COMPUTATIONAL BIOLOGY | Bioinformatics | Computer Science
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 2009, Volume 410, Issue 8, pp. 958 - 962
We show how, given a probability distribution over a set of size , in time we can construct an efficient data structure that stores a code with less than 3... 
Data structures | Data compression | COMPUTER SCIENCE, THEORY & METHODS | SEARCH TREES | CODES | LENGTH | Computer science
Journal Article
Algorithms, ISSN 1999-4893, 03/2012, Volume 5, Issue 1, pp. 50 - 55
  Building on results from data compression, we prove nearly tight bounds on how well sequences of length n can be predicted in terms of the size σ of the... 
Alphabet size | Analysis | Sequence prediction | sequence prediction | analysis | alphabet size
Journal Article
ALGORITHMS FOR MOLECULAR BIOLOGY, ISSN 1748-7188, 05/2019, Volume 14, Issue 1, pp. 13 - 13
Journal Article
Information Processing Letters, ISSN 0020-0190, 2006, Volume 99, Issue 6, pp. 246 - 251
Journal Article
Journal of Discrete Algorithms, ISSN 1570-8667, 2012, Volume 10, Issue 1, pp. 2 - 4
We describe a new variation of a mathematical card trick, whose analysis leads to new lower bounds for data compression and estimating the entropy of a Markov... 
Estimating entropy | Markov sources | Empirical entropy
Journal Article
International Journal of Foundations of Computer Science, ISSN 0129-0541, 12/2018, Volume 29, Issue 8, pp. 1279 - 1295
Compressed suffix trees and bidirectional FM-indexes can store a set of strings and support queries that let us explore the set of substrings they contain,... 
bidirectional FM-index | de Bruijn graphs | Burrows-Wheeler transform | SINGLE-CELL | WAVELET TREES | NOVO ASSEMBLER | IDBA | COMPUTER SCIENCE, THEORY & METHODS | ALGORITHMS
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 10/2017, Volume 698, pp. 4 - 8
Cadences are syntactic regularities in strings, of the family of periods, squares, and repetitions. We say a string has a cadence if a certain character is... 
Cadences | String algorithms | Pattern mining | String regularities | PATTERNS | COMPUTER SCIENCE, THEORY & METHODS | Computer science | Mineral industry | Algorithms | Phylogeny | Mining industry
Journal Article
Information Processing Letters, ISSN 0020-0190, 2008, Volume 108, Issue 6, pp. 352 - 355
We show how any dynamic instantaneous compression algorithm can be converted to an asymmetric communication protocol, with which a server with high bandwidth... 
Asymmetric communication | Data compression | On-line algorithms | COMPUTER SCIENCE, INFORMATION SYSTEMS | PROTOCOLS | Studies | Algorithms | Protocol | Bandwidths | Communication
Journal Article
Fundamenta Informaticae, ISSN 0169-2968, 2009, Volume 97, Issue 3, pp. 321 - 329
We show how to build an alphabetic minimax tree for a sequence W = w(1),...,w(n) of real weights in O(nd log log n) time, where d is the number of distinct... 
Alphabetic minimax trees | Data structures | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | data structures | BINARY-TREES | alphabetic minimax trees
Journal Article
Bioinformatics, ISSN 1367-4803, 10/2017, Volume 33, Issue 20, pp. 3181 - 3187
Motivation: In 2012, Iqbal et al. introduced the colored de Bruijn graph, a variant of the classic de Bruijn graph, which is aimed at 'detecting and genotyping... 
ASSEMBLER | SEQUENCE DATA | GENOMES | BIOTECHNOLOGY & APPLIED MICROBIOLOGY | ANNOTATION | BIOCHEMICAL RESEARCH METHODS | MATHEMATICAL & COMPUTATIONAL BIOLOGY | RESISTANCE | Software | Algorithms | Eukaryota - genetics | Genotyping Techniques - methods | Bacteria - genetics | Sequence Analysis, DNA - methods | Index Medicus | Original Papers
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.