Combinatorial Pattern Matching

DOI10.1007/b137128zbMath1130.68314MaRDI 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

68R15: Combinatorics on words

68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)

92D10: Genetics and epigenetics

Related Items

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