Načítá se...
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...
Uloženo v:
| Vydáno v: | Algorithms Mol Biol |
|---|---|
| Hlavní autoři: | , , , , , |
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
BioMed Central
2021
|
| Témata: | |
| On-line přístup: | https://ncbi.nlm.nih.gov/pmc/articles/PMC8240273/ https://ncbi.nlm.nih.gov/pubmed/34183036 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/s13015-021-00191-8 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|