Computing Inverse ST in Linear Complexity

DOI10.1007/978-3-540-69068-9_18zbMath1143.68388OpenAlexW1485920490MaRDI QIDQ3506952

Sen Zhang, Wai Hong Chan, Ge Nong

Publication date: 17 June 2008

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69068-9_18

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Nonnumerical algorithms (68W05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (1)

\(xkcd\)-repeats: a new taxonomy of repeats defined by their context diversity

This page was built for publication: Computing Inverse ST in Linear Complexity