Φορτώνει......
Linear-time computation of minimal absent words using suffix array
BACKGROUND: An absent word of a word y of length n is a word that does not occur in y. It is a minimal absent word if all its proper factors occur in y. Minimal absent words have been computed in genomes of organisms from all domains of life; their computation also provides a fast alternative for me...
Αποθηκεύτηκε σε:
| Τόπος έκδοσης: | BMC Bioinformatics |
|---|---|
| Κύριοι συγγραφείς: | , , , |
| Μορφή: | Artigo |
| Γλώσσα: | Inglês |
| Έκδοση: |
BioMed Central
2014
|
| Θέματα: | |
| Διαθέσιμο Online: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4297395/ https://ncbi.nlm.nih.gov/pubmed/25526884 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/s12859-014-0388-9 |
| Ετικέτες: |
Προσθήκη ετικέτας
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|