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

An algorithm for the constrained heaviest common subsequence problem

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

zbMATH Open1089.68134MaRDI QIDQ3378281FDOQ3378281


Authors: Rao Li, Richard Shick, David Smiley Edit this on Wikidata


Publication date: 30 March 2006





Recommendations

  • A linear space algorithm for the heaviest common subsequence problem
  • The constrained longest common subsequence problem
  • ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS
  • Weighted LCS (extended abstract)
  • A simple algorithm for the constrained sequence problems


Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)



Cited In (3)

  • Weighted LCS (extended abstract)
  • Weighted LCS
  • A linear space algorithm for the heaviest common subsequence problem





This page was built for publication: An algorithm for the constrained heaviest common subsequence problem

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

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