Using the longest run subsequence problem within homology-based scaffolding

Schrinner, S.; Goel, M.; Wulfert, M.; Spohr, P.; Schneeberger, K.; Klau, G. W.

doi:10.1186/s13015-021-00191-8

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Using the longest run subsequence problem within homology-based scaffolding

MPS-Authors

/persons/resource/persons255970

Goel, M.
Dept. of Chromosome Biology (Raphael Mercier), MPI for Plant Breeding Research, Max Planck Society;
IMPRS, MPI for Plant Breeding Research, Max Planck Society;

/persons/resource/persons49245

Schneeberger, K.
Dept. of Chromosome Biology (Raphael Mercier), MPI for Plant Breeding Research, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

schrinner_algo_mol_biol_2021.pdf
(Publisher version), 2MB

Supplementary Material (public)

There is no public supplementary material available

Citation

Schrinner, S., Goel, M., Wulfert, M., Spohr, P., Schneeberger, K., & Klau, G. W. (2021). Using the longest run subsequence problem within homology-based scaffolding. Algorithms for Molecular Biology, 16(1): 11. doi:10.1186/s13015-021-00191-8.

Cite as: https://hdl.handle.net/21.11116/0000-0008-FBB9-D

Abstract

There is no abstract available