Using the longest run subsequence problem within homology-based scaffolding

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 related specie...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Algorithms for molecular biology Ročník 16; číslo 1; s. 1 - 11
Hlavní autori: Schrinner, Sven, Goel, Manish, Wulfert, Michael, Spohr, Philipp, Schneeberger, Korbinian, Klau, Gunnar W.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: London BioMed Central 28.06.2021
Springer Nature B.V
BMC
Predmet:
Algorithms
Alignment
Assembly
Bioinformatics
Biomedical and Life Sciences
Cellular and Medical Topics
Chromosomes
Computational Biology/Bioinformatics
Computer applications
Genomes
Homology
Life Sciences
Linear programming
Longest subsequence
Mutation
Physiological
Scaffolding
Selected papers from WABI 2020
Source code
String algorithm
String algorithm
Alignment
Longest subsequence
Assembly
ISSN:1748-7188, 1748-7188
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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 related species. The idea is to use alignments of binned regions in one contig to find the most homologous contig in the other assembly. We show that ordering the contigs of the other assembly can be expressed by a new string problem, the longest run subsequence problem (LRS). We show that LRS is NP-hard and present reduction rules and two algorithmic approaches that, together, are able to solve large instances of LRS to provable optimality. All data used in the experiments as well as our source code are freely available. We demonstrate its usefulness within an existing larger scaffolding approach by solving realistic instances resulting from partial Arabidopsis thaliana assemblies in short computation time.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1748-7188
1748-7188
DOI:10.1186/s13015-021-00191-8