Finding consensus strings with small length difference between input and solution strings

DOI10.1007/978-3-662-48054-0_45MaRDI QIDQ2946423zbMATH OpenOpenAlexFDO

Authors Markus L. Schmid

Publication date 16 September 2015

Published in Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-48054-0_45

zbMATH Keywords

hard string problemsparameterised complexity

Mathematics Subject Classification ID

Parameterized complexity, tractability and kernelization (68Q27) Algorithms on strings (68W32)

Recommendations

• Finding consensus strings with small length difference between input and solution strings
• Closest Substring Problems with Small Distances
• Consensus strings with small maximum distance and small distance sum
• Consensus strings with small maximum distance and small distance sum
• On the parameterized intractability of motif search problems

Cites work

• Closest Substring Problems with Small Distances
• Fixed-parameter algorithms for CLOSEST STRING and related problems
• scientific article; zbMATH DE number 4070305 (Why is no real title available?)
• Multivariate algorithmics for NP-hard string problems
• On covering problems of codes
• On the complexity of finding common approximate substrings.
• On the parameterized intractability of motif search problems
• Parametrized complexity theory.

Cited in

(4)

• Finding consensus and optimal alignment of circular strings
• Consensus strings with small maximum distance and small distance sum
• Finding consensus strings with small length difference between input and solution strings
• Consensus strings with small maximum distance and small distance sum

This page was built for publication: Finding consensus strings with small length difference between input and solution strings

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