Reconstructing strings from substrings (Extended abstract)

DOI10.1007/3-540-57155-8_280zbMATH Open1504.68298OpenAlexW1596668669MaRDI QIDQ5060147FDOQ5060147

Authors: Gopalakrishnan Sundaram, Steven Skiena 

Publication date: 18 January 2023

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

Full work available at URL: https://doi.org/10.1007/3-540-57155-8_280

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32)

Cites Work

• Matching, Euler tours and the Chinese postman
• Normal Recurring Decimals
• On the complexity of edge traversing
• Constructing optimal binary decision trees is NP-complete
• String overlaps, pattern matching, and nontransitive games
• The Editor's Corner: Strings, Substrings, and the `Nearest Integer' Function

This page was built for publication: Reconstructing strings from substrings (Extended abstract)

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