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...
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: | |
Online Access: | https://doi.org/10.1186/s13015-021-00191-8 |
Similar Items
-
Using the longest run subsequence problem within homology-based scaffolding
by: Goel, M., et al.
Published: (2021) -
A Novel Efficient Graph Model for the Multiple Longest Common Subsequences (MLCS) Problem
by: Zhan Peng, et al.
Published: (2017-08-01) -
Small Longest Tandem Scattered Subsequences
by: Luıs M. S. Russo, et al.
Published: (2021-08-01) -
The Distribution of the Length of the Longest Increasing Subsequence in Random Permutations of Arbitrary Multi-sets
by: Al-Meanazel, Ayat
Published: (2015) -
Automatic Arabic Short Answers Scoring Using Longest Common Subsequence and Arabic WordNet
by: Hikmat A. Abdeljaber
Published: (2021-01-01)