Lanean...
PairMotif: A New Pattern-Driven Algorithm for Planted (l, d) DNA Motif Search
Motif search is a fundamental problem in bioinformatics with an important application in locating transcription factor binding sites (TFBSs) in DNA sequences. The exact algorithms can report all (l, d) motifs and find the best one under a specific objective function. However, it is still a challengi...
Gorde:
| Egile Nagusiak: | , , , |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
Public Library of Science
2012
|
| Gaiak: | |
| Sarrera elektronikoa: | https://ncbi.nlm.nih.gov/pmc/articles/PMC3485246/ https://ncbi.nlm.nih.gov/pubmed/23119020 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1371/journal.pone.0048442 |
| Etiketak: |
Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|