Chargement en cours...
Fast algorithms for approximate circular string matching
BACKGROUND: Circular string matching is a problem which naturally arises in many biological contexts. It consists in finding all occurrences of the rotations of a pattern of length m in a text of length n. There exist optimal average-case algorithms for exact circular string matching. Approximate ci...
Enregistré dans:
| Publié dans: | Algorithms Mol Biol |
|---|---|
| Auteurs principaux: | , , |
| Format: | Artigo |
| Langue: | Inglês |
| Publié: |
BioMed Central
2014
|
| Sujets: | |
| Accès en ligne: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4234210/ https://ncbi.nlm.nih.gov/pubmed/24656145 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/1748-7188-9-9 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|