טוען...
External memory BWT and LCP computation for sequence collections with applications
BACKGROUND: Sequencing technologies produce larger and larger collections of biosequences that have to be stored in compressed indices supporting fast search operations. Many compressed indices are based on the Burrows–Wheeler Transform (BWT) and the longest common prefix (LCP) array. Because of the...
שמור ב:
| הוצא לאור ב: | Algorithms Mol Biol |
|---|---|
| Main Authors: | , , , |
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
BioMed Central
2019
|
| נושאים: | |
| גישה מקוונת: | https://ncbi.nlm.nih.gov/pmc/articles/PMC6408864/ https://ncbi.nlm.nih.gov/pubmed/30899322 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/s13015-019-0140-0 |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|