Pages that link to "Item:Q2465062"
From MaRDI portal
The following pages link to An extension of the Burrows-Wheeler transform (Q2465062):
Displaying 44 items.
- Lightweight algorithms for constructing and inverting the BWT of string collections (Q390898) (← links)
- Suffix array and Lyndon factorization of a text (Q405567) (← links)
- A bijection between words and multisets of necklaces (Q444410) (← links)
- Tighter bounds for the sum of irreducible LCP values (Q507409) (← links)
- Burrows-Wheeler transformations and de Bruijn words (Q714849) (← links)
- The Burrows-Wheeler similarity distribution between biological sequences based on Burrows-Wheeler transform (Q1629110) (← links)
- Wheeler graphs: a framework for BWT-based data structures (Q1676308) (← links)
- New method for comparing DNA primary sequences based on a discrimination measure (Q1726139) (← links)
- Phylogenetic analysis of DNA sequences based on \(k\)-word and rough set theory (Q1782617) (← links)
- Inverse Lyndon words and inverse Lyndon factorizations of words (Q1795498) (← links)
- On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties (Q1998861) (← links)
- Computing the multi-string BWT and LCP array in external memory (Q1998862) (← links)
- Wheeler languages (Q2051845) (← links)
- String inference from longest-common-prefix array (Q2110373) (← links)
- Space efficient merging of de Bruijn graphs and Wheeler graphs (Q2118200) (← links)
- On the complexity of recognizing Wheeler graphs (Q2118211) (← links)
- r-indexing the eBWT (Q2146118) (← links)
- Computing the original eBWT faster, simpler, and with less memory (Q2146134) (← links)
- Can formal languages help pangenomics to represent and analyze multiple genomes? (Q2163974) (← links)
- When a dollar makes a BWT (Q2220786) (← links)
- Space-efficient construction of compressed suffix trees (Q2220837) (← links)
- Distance measures for biological sequences: some recent approaches (Q2270379) (← links)
- Refining the \(r\)-index (Q2297853) (← links)
- Lightweight merging of compressed indices based on BWT variants (Q2297864) (← links)
- The alternating BWT: an algorithmic perspective (Q2297865) (← links)
- A bijective variant of the Burrows-Wheeler transform using \(V\)-order (Q2441784) (← links)
- A new combinatorial approach to sequence comparison (Q2481558) (← links)
- Lightweight LCP construction for very large collections of strings (Q2628803) (← links)
- Tighter Bounds for the Sum of Irreducible LCP Values (Q2942269) (← links)
- Lightweight BWT Construction for Very Large String Collections (Q3011856) (← links)
- Full-Text Indexes for High-Throughput Sequencing (Q3305517) (← links)
- Sturmian and Episturmian Words (Q3522857) (← links)
- On the Hardness and Inapproximability of Recognizing Wheeler Graphs (Q5075794) (← links)
- (Q5088889) (← links)
- Space-efficient computation of the LCP array from the Burrows-Wheeler transform (Q5088894) (← links)
- Indexing the bijective BWT (Q5088907) (← links)
- Detecting Mutations by eBWT (Q5090327) (← links)
- (Q5090335) (← links)
- Lightweight BWT and LCP Merging via the Gap Algorithm (Q5150930) (← links)
- SORTING CONJUGATES AND SUFFIXES OF WORDS IN A MULTISET (Q5247182) (← links)
- The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words (Q5326383) (← links)
- A new class of string transformations for compressed text indexing (Q6053405) (← links)
- Computational graph pangenomics: a tutorial on data structures and their applications (Q6155034) (← links)
- Constructing and indexing the bijective and extended Burrows-Wheeler transform (Q6204171) (← links)
