Mathematical Foundations of Computer Science 2003

DOI10.1007/b11836zbMath1124.68348OpenAlexW2495578842MaRDI QIDQ5431307

Masayuki Takeda, Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara

Publication date: 7 December 2007

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

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

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Data structures (68P05)

Related Items (25)

Subsequence automata with default transitions ⋮ Universal Reconstruction of a String ⋮ On left and right seeds of a string ⋮ Inferring strings from Lyndon factorization ⋮ Recognizing union-find trees is NP-complete ⋮ Inferring strings from position heaps in linear time ⋮ Indeterminate string inference algorithms ⋮ Reconstructing parameterized strings from parameterized suffix and LCP arrays ⋮ Constructing an indeterminate string from its associated graph ⋮ On the combinatorics of suffix arrays ⋮ Verifying and enumerating parameterized border arrays ⋮ When a dollar makes a BWT ⋮ A new approach to regular \& indeterminate strings ⋮ Counting suffix arrays and strings ⋮ Indeterminate strings, prefix arrays \& undirected graphs ⋮ Inferring strings from suffix trees and links on a binary alphabet ⋮ A quick tour on suffix arrays and compressed suffix arrays ⋮ A note on the Burrows-Wheeler transformation ⋮ Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info ⋮ Counting Parameterized Border Arrays for a Binary Alphabet ⋮ Universal reconstruction of a string ⋮ On the size of the smallest alphabet for Lyndon trees ⋮ Inferring an indeterminate string from a prefix graph ⋮ A suffix tree or not a suffix tree? ⋮ String inference from longest-common-prefix array

This page was built for publication: Mathematical Foundations of Computer Science 2003