Fixed-parameter algorithms for scaffold filling

DOI10.1007/978-3-319-09174-7_12MaRDI QIDQ3195323zbMATH OpenOpenAlexFDO

Authors Laurent Bulteau, Anna Paola Carrieri, Riccardo Dondi

Publication date 16 October 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-09174-7_12

zbMATH Keywords

comparative genomicsscaffold filling

Mathematics Subject Classification ID

Parameterized complexity, tractability and kernelization (68Q27) Genetics and epigenetics (92D10)

Recommendations

• Fixed-parameter algorithms for scaffold filling
• scientific article; zbMATH DE number 7203332
• Genomic scaffold filling revisited
• Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies
• The algorithm for the two-sided scaffold filling problem

Cited in

(5)

• Comparing incomplete sequences via longest common subsequence
• Fixed-parameter algorithms for scaffold filling
• An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies
• A retrospective on genomic preprocessing for comparative genomics
• The necessary and sufficient condition and the efficient algorithms for gradually varied fill

This page was built for publication: Fixed-parameter algorithms for scaffold filling

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