FM-index of alignment with gaps
From MaRDI portal
Publication:1698723
DOI10.1016/j.tcs.2017.02.020zbMath1386.68237arXiv1606.03897OpenAlexW2963856156MaRDI QIDQ1698723
Joong Chae Na, Heejin Park, Laurent Mouchard, Thierry Lecroq, Martine Léonard, Seunghwan Min, Kun Soo Park, Hyun-Joon Kim
Publication date: 16 February 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.03897
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Genetics and epigenetics (92D10) Algorithms on strings (68W32)
Related Items
Algorithms and complexity on indexing founder graphs, Approximate pattern matching on elastic-degenerate text, Lightweight merging of compressed indices based on BWT variants, Haplotype-aware graph indexes, Space efficient merging of de Bruijn graphs and Wheeler graphs
Uses Software
Cites Work
- Unnamed Item
- FM-index of alignment: a compressed index for similar strings
- On compressing and indexing repetitive sequences
- Fast relative Lempel-Ziv self-index for similar sequences
- Suffix Tree of Alignment: An Efficient Index for Similar Data
- Indexing Highly Repetitive Collections
- Composite Repetition-Aware Data Structures
- Hybrid indexes for repetitive datasets
- Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and Retrieval
- Compressing and indexing labeled trees, with applications
- Indexing compressed text
- Indexing Similar DNA Sequences
- Storage and Retrieval of Individual Genomes
- A universal algorithm for sequential data compression
- Succinct de Bruijn Graphs
- Indexing Variation Graphs
- Faster Compressed Suffix Trees for Repetitive Collections
- Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
