Using the longest run subsequence problem within homology-based scaffolding

Using the longest run subsequence problem within homology-based scaffolding

Abstract Genome assembly is one of the most important problems in computational genomics. Here, we suggest addressing an issue that arises in homology-based scaffolding, that is, when linking and ordering contigs to obtain larger pseudo-chromosomes by means of a second incomplete assembly of a relat...

Full description

Bibliographic Details
Main Authors: Sven Schrinner, Manish Goel, Michael Wulfert, Philipp Spohr, Korbinian Schneeberger, Gunnar W. Klau
Format: Article
Language:English
Published: BMC 2021-06-01
Series:Algorithms for Molecular Biology
Subjects:
Alignment
Assembly
String algorithm
Longest subsequence
Online Access:https://doi.org/10.1186/s13015-021-00191-8

Internet

https://doi.org/10.1186/s13015-021-00191-8

Similar Items