Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Cyclic longest common subsequence

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

DOI10.1142/S1793830922501038OpenAlexW4224986604MaRDI QIDQ6132857

Unnamed Author, Unnamed Author, Aaron E. Naiman

Publication date: 15 July 2023

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830922501038


zbMATH Keywords

efficient algorithmlongest common subsequencecyclicclustered subsequences


Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)





Cites Work

  • Longest common subsequence problem for unoriented and cyclic strings
  • Unnamed Item




This page was built for publication: Cyclic longest common subsequence

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6132857&oldid=35598910"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 10 July 2024, at 06:33.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki