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

Descripción completa

Detalles Bibliográficos
Autores principales: Schrinner, Sven, Goel, Manish, Wulfert, Michael, Spohr, Philipp, Schneeberger, Korbinian, Klau, Gunnar W.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2021
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8240273/
https://www.ncbi.nlm.nih.gov/pubmed/34183036
http://dx.doi.org/10.1186/s13015-021-00191-8

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8240273/
https://www.ncbi.nlm.nih.gov/pubmed/34183036
http://dx.doi.org/10.1186/s13015-021-00191-8

Ejemplares similares