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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithms for molecular biology Jg. 16; H. 1; S. 1 - 11
Hauptverfasser:	Schrinner, Sven, Goel, Manish, Wulfert, Michael, Spohr, Philipp, Schneeberger, Korbinian, Klau, Gunnar W.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	London BioMed Central 28.06.2021 Springer Nature B.V BMC
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!