Fast and practical algorithms for planted ( l, d ) motif search.
Autor principal: | Davila, Jaime |
---|---|
Otros Autores: | Balla, Sudha, Rajasekaran, Sanguthevar |
Formato: | Artículo |
Lenguaje: | Spanish |
Materias: |
Ejemplares similares
-
BASES OF MOTIFS FOR GENERATING REPEATED PATTERNS WITH WILD CARDS.
por: PISANTI, NADIA -
An efficient algorithm for the identification of structured motifs in DNA promoter sequences.
por: Carvalho, Alexandra M. -
Matrix numerov method for solving Schrödinger’s equation /
por: Pillai, Mohandas -
AN O(N2) ALGORITHM FOR DISCOVERING OPTIMAL BOOLEAN PATTERN PAIRS.
por: BANNAI, HIDEO -
Motif search in graphs : Application to metabolic networks.
por: Lacroix, Vincent