Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Reconstructing strings from substrings (Extended abstract)

From MaRDI portal
Publication:5060147
Jump to:navigation, search

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


Authors: Gopalakrishnan Sundaram, Steven Skiena Edit this on Wikidata


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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5060147&oldid=19541164"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 11:39. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki