Yüklüyor......
gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections
BACKGROUND: The construction of a suffix array for a collection of strings is a fundamental task in Bioinformatics and in many other applications that process strings. Related data structures, as the Longest Common Prefix array, the Burrows–Wheeler transform, and the document array, are often needed...
Kaydedildi:
| Yayımlandı: | Algorithms Mol Biol |
|---|---|
| Asıl Yazarlar: | , , , , |
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
BioMed Central
2020
|
| Konular: | |
| Online Erişim: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7507297/ https://ncbi.nlm.nih.gov/pubmed/32973918 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/s13015-020-00177-y |
| Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|