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

scientific article; zbMATH DE number 139916

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

zbMATH Open0768.68143MaRDI QIDQ4028258FDOQ4028258


Authors: Frank Owen Hadlock Edit this on Wikidata


Publication date: 28 March 1993



Title of this publication is not available (Why is that?)



Recommendations

  • Alignments and approximate string matching
  • Efficient algorithms for similarity search
  • String Processing and Information Retrieval
  • Data structures and algorithms for approximate string matching
  • Publication:4952703


zbMATH Keywords

shortest path problemefficient algorithmtransformation graphminimum detour algorithmset sequence classificationset sequence matching


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Paths and cycles (05C38)



Cited In (3)

  • Set intersection and sequence matching with mismatch counting
  • Comparing finite sequences of discrete events with non-uniform time intervals
  • Efficient algorithms for similarity search





This page was built for publication:

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

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