Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-89097-3_17
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Optimal Construction of Compressed Indexes for Highly Repetitive Texts

2019English

Faster Compressed Suffix Trees for Repetitive Text Collections

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Matching for Run-Length Encoded Strings

Journal of Complexity
ControlNumerical AnalysisStatisticsProbabilityAlgebraApplied MathematicsNumber TheoryOptimizationMathematics
1999English

Run Length Coding for Image Analysis.

1977English

Collections ofPuccinia Triticinain Different Provinces of China Are Highly Related for Virulence and Molecular Genotype

Phytopathology
Plant ScienceAgronomyCrop Science
2015English

Run Length Synchronization Techniques

1969English

Simulation Run Length Planning

English

How Repetitive Are Genomes?

BMC Bioinformatics
BiochemistryApplied MathematicsComputer Science ApplicationsStructural BiologyMolecular Biology
2006English

On the Reproducibility of Experiments of Indexing Repetitive Document Collections

Information Systems
HardwareInformation SystemsArchitectureSoftware
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy