The longest run subsequence problem

DOI10.4230/LIPICS.WABI.2020.6MaRDI QIDQ6487630zbMATH OpenFDO

Authors Sven Schrinner, Manish Goel, Michael Wulfert, Philipp Spohr, Korbinian Schneeberger, Gunnar W. Klau

Publication date 7 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.WABI.2020.6

zbMATH Keywords

alignmentsassemblystring algorithmlongest subsequence

Mathematics Subject Classification ID

Genetics and epigenetics (92D10) Protein sequences, DNA sequences (92D20) Computational methods for problems pertaining to biology (92-08) Algorithms on strings (68W32)

Recommendations

• Producing genomic sequences after genome scaffolding with ambiguous paths: complexity, approximation and lower bounds
• On the linearization of scaffolds sharing repeated contigs
• The longest filled common subsequence problem
• Comparing incomplete sequences via longest common subsequence
• Global optimization for scaffolding and completing genome assemblies

Cites work

• A Cutting Plane Algorithm for the Linear Ordering Problem

Cited in

(2)

• Longest bordered and periodic subsequences
• The longest letter-duplicated subsequence and related problems

This page was built for publication: The longest run subsequence problem

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