Indeterminate string factorizations and degenerate text transformations
From MaRDI portal
Publication:2363995
DOI10.1007/s11786-016-0285-xzbMath1370.68243OpenAlexW2583491810WikidataQ59614307 ScholiaQ59614307MaRDI QIDQ2363995
Publication date: 17 July 2017
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-016-0285-x
linearinverse transformindeterminate Lyndon worddegenerate biological stringdegenerate Burrows-Wheeler transformindeterminate suffix arraylex-extension order
Combinatorics on words (68R15) Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A four-stage algorithm for updating a Burrows-Wheeler transform
- A new approach to pattern matching in degenerate DNA/RNA sequences and distributed pattern matching
- Finite automata based algorithms on subsequences and supersequences of degenerate strings
- The constrained longest common subsequence problem
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- Periodic musical sequences and Lyndon words
- A note on the Burrows-Wheeler transformation
- Lyndon-like and V-order factorizations of strings
- Succinct 2D dictionary matching
- A bijective variant of the Burrows-Wheeler transform using \(V\)-order
- Simple Real-Time Constant-Space String Matching
- On Burnside's Problem. II
- Factorizing words over an ordered alphabet
- PROPERTIES AND CONSTRUCTION OF UNIQUE MAXIMAL FACTORIZATION FAMILIES FOR STRINGS
- Space Efficient Linear Time Construction of Suffix Arrays
- Two-way string-matching
- Fast parallel Lyndon factorization with applications
- Lightweight LCP Construction for Next-Generation Sequencing Datasets
- A Constant-Space Comparison-Based Algorithm for Computing the Burrows–Wheeler Transform
- Combinatorial Pattern Matching
- On Burnside's Problem
- Free differential calculus. IV: The quotient groups of the lower central series
