A linear-time algorithm for computing characteristic strings

DOI10.1007/3-540-58325-4_195MaRDI QIDQ4525717zbMATH OpenFDO

Authors Michio Nakanishi, Morio Hasidume, Minoru Ito, Akihiro Hashimoto

Publication date 24 January 2001

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

Full work available at URL https://doi.org/10.1007/3-540-58325-4_195

zbMATH Keywords

DNA probestring matchingsuffix tree

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Protein sequences, DNA sequences (92D20)

Recommendations

• Character sets of strings
• String Processing and Information Retrieval
• scientific article; zbMATH DE number 1445802
• Linear time algorithm for the longest common repeat problem
• A new algorithm for the characteristic string problem under loose similarity criteria

Cited in

(4)

• A VLSI algorithm for sorting variable-length character strings
• A new distance metric on strings computable in linear time
• Center and distinguisher for strings with unbounded alphabet
• A new algorithm for the characteristic string problem under loose similarity criteria

This page was built for publication: A linear-time algorithm for computing characteristic strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4525717)