On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
METADATA ONLY
Loading...
Author / Producer
Date
2003-12
Publication Type
Journal Article
ETH Bibliography
yes
Citations
Altmetric
METADATA ONLY
Data
Rights / License
Permanent link
Publication status
published
External links
Editor
Book title
Journal / series
Volume
67 (4)
Pages / Article No.
757 - 771
Publisher
Elsevier
Event
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Parameterized complexity; Longest common subsequence; Shortest common supersequence; Multiple sequence alignment