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...
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
BioMed Central Ltd
2021
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |