Motif search using Gibbs sampling: Notes on effectiveness in a distributed environment
© 2019 IEEE. Motif search is a common problem in bioinformatics where unique DNA sequences (motifs) of a specific length inscribed in long strands signify binding sites for transcription factors. In this paper, we present some important notes on the implementation of motif search using Gibbs samplin...
Saved in:
Main Authors: | Imperial, Joseph Marvin R., Gail Ya-On, Czeritonnie, Cu, Gregory G. |
---|---|
Format: | text |
Published: |
Animo Repository
2019
|
Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/947 https://animorepository.dlsu.edu.ph/context/faculty_research/article/1946/type/native/viewcontent |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Similar Items
-
Distributed Gibbs: A memory-bounded sampling-based DCOP algorithm
by: NGUYEN, Duc Thien, et al.
Published: (2013) -
Distributed Gibbs: A linear-space sampling-based DCOP algorithm
by: NGUYEN, Duc Thien, et al.
Published: (2019) -
An experimental Tagalog Finite State Automata spellchecker with Levenshtein edit-distance feature
by: Imperial, Joseph Marvin R., et al.
Published: (2019) -
ANALISIS BAYESIAN UNTUK REGRESI KUANTIL DENGAN MENGGUNAKAN ALGORITMA GIBBS SAMPLING
by: , ANNISA HANIF, et al.
Published: (2013) -
On the Gibbs-Thomson effect in concentrated binary systems
by: Qian, M., et al.
Published: (2014)