Pages that link to "Item:Q1770410"
From MaRDI portal
The following pages link to A note on the Burrows-Wheeler transformation (Q1770410):
Displayed 13 items.
- A linear partitioning algorithm for hybrid Lyndons using \(V\)-order (Q390899) (← links)
- A bijection between words and multisets of necklaces (Q444410) (← links)
- A quick tour on suffix arrays and compressed suffix arrays (Q544881) (← links)
- Burrows-Wheeler transformations and de Bruijn words (Q714849) (← links)
- A four-stage algorithm for updating a Burrows-Wheeler transform (Q732025) (← links)
- Counting suffix arrays and strings (Q932319) (← links)
- An extension of the Burrows-Wheeler transform (Q2465062) (← links)
- A new combinatorial approach to sequence comparison (Q2481558) (← links)
- Two Combinatorial Criteria for BWT Images (Q3007642) (← links)
- String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time (Q3011844) (← links)
- Sturmian and Episturmian Words (Q3522857) (← links)
- Generic Algorithms for Factoring Strings (Q4915247) (← links)
- The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words (Q5326383) (← links)