Powered by OpenAIRE graph
Found an issue? Give us feedback
downloadFull-Text
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ DROPS - Dagstuhl Res...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
DROPS - Dagstuhl Research Online Publication Server (Schloss Dagstuhl - Leibniz Center for Informatics )
Article . 2022
License: CC BY
Full-Text: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2022.15
Data sources: Bielefeld Academic Search Engine (BASE)
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Dagstuhl Research Online Publication Server
Conference object . 2022
License: CC BY
Data sources: Dagstuhl Research Online Publication Server
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Discrete Applied Mathematics
Article . 2024 . Peer-reviewed
License: Elsevier TDM
Data sources: Crossref
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article . 2024
Data sources: zbMATH Open
DBLP
Conference object
Data sources: DBLP
DBLP
Article
Data sources: DBLP
 View all 5 versions
Claim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Polynomial-time equivalences and refined algorithms for longest common subsequence variants

descriptionPublicationkeyboard_double_arrow_right Article , Conference object 01 Aug 2024 Germany English Publisher:Elsevier BVJournal:Discrete Applied Mathematics, volume 353, pages 44-64 (issn: 0166-218X, Copyright policy )Funded by:NSERC | unidentified
Authors: Yuichi Asahiro; Jesper Jansson 0001; Guohui Lin; Eiji Miyano; Hirotaka Ono 0001; Tadatoshi Utashima;

doi: 10.1016/j.dam.2024.04.006

Polynomial-time equivalences and refined algorithms for longest common subsequence variants

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Country
Germany
Related Organizations
View all View all
Keywords

dynamic programming, exact algorithms, two-side-filled, Theory of computing, multiset restricted longest common subsequence problem, exact algorithm, repetition-bounded, one-side-filled longest common subsequence problem, 004, Theory of software, one-side-filled, and approximation algorithms, Repetition-bounded longest common subsequence problem, longest common subsequence, two-side-filled longest common subsequence problem, Algorithms in computer science, multiset-restricted, approximation algorithm, ddc: ddc:004

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 1
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    		 Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    		 Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
1
Average
Average
Average
Green
Related to Research communities
UArctic