Optimal Construction of Compressed Indexes for Highly Repetitive Texts

doi 10.1137/1.9781611975482.82
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Faster Compressed Suffix Trees for Repetitive Text Collections

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Construction of Capacities From Overlap Indexes

Studies in Computational Intelligence
Artificial Intelligence
2017English

Construction of Daily Hedonic Housing Indexes for Apartments in Sweden

2017English

A Framework for Assessing Reading Comprehension of Geometric Construction Texts

International Journal of Science and Mathematics Education
MathematicsEducation
2016English

Repetitive Regime of Highly Focused Liquid Microjets for Needle-Free Injection

Scientific Reports
Multidisciplinary
2020English

Automatic Design of Basin-Specific Drought Indexes for Highly Regulated Water Systems

2018English

Optimal Permutation Based Block Compressed Sensing for Image Compression Applications

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2018English

Optimal Distance Estimation Between Compressed Data Series

2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy