Combinatorial Pattern Matching

DOI10.1007/b137128zbMath1130.68314OpenAlexW4301315466MaRDI QIDQ5713539

Marinella Sciortino, Giovanna Rosone, Antonio Restivo, Sabrina Mantaci

Publication date: 14 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b137128

Mathematics Subject Classification ID

Combinatorics on words (68R15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Genetics and epigenetics (92D10)

Related Items (16)

Indeterminate string factorizations and degenerate text transformations ⋮ An estimator for local analysis of genome based on the minimal absent word ⋮ The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words ⋮ Wheeler graphs: a framework for BWT-based data structures ⋮ Lightweight algorithms for constructing and inverting the BWT of string collections ⋮ Algorithms to compute the Burrows-Wheeler similarity distribution ⋮ A survey of string orderings and their application to the Burrows-Wheeler transform ⋮ A bijective variant of the Burrows-Wheeler transform using \(V\)-order ⋮ An extension of the Burrows-Wheeler transform ⋮ Binary block order Rouen transform ⋮ Lightweight BWT Construction for Very Large String Collections ⋮ Computing the multi-string BWT and LCP array in external memory ⋮ A new combinatorial approach to sequence comparison ⋮ Distance measures for biological sequences: some recent approaches ⋮ Burrows-Wheeler transformations and de Bruijn words ⋮ On the complexity of recognizing Wheeler graphs

This page was built for publication: Combinatorial Pattern Matching