Search Results - "G.2 DISCRETE MATHEMATICS. Graph algorithms"

An Efficient Combinatorial Approach for Solving the DNA Motif Finding Problem

Authors: Geraci F Pellegrini M Renda M E

Source: Ninth International Conference on Intelligent Systems Design and Applications, Pisa, Italy, 2009
info:cnr-pdr/source/autori:Geraci F.; Pellegrini M.; Renda M. E./congresso_nome:Ninth International Conference on Intelligent Systems Design and Applications/congresso_luogo:Pisa, Italy/congresso_data:2009/anno:2009/pagina_da:/pagina_a:/intervallo_pagine

Subject Terms: (l-d) Challenge Problem, graph-based algorithm, G.2 DISCRETE MATHEMATICS. Graph algorithms, TFBS detection, motif finding problem

Access URL: https://publications.cnr.it/doc/83677
http://www.cnr.it/prodotto/i/83677
http://wwwold.iit.cnr.it/staff/marco.pellegrini/papiri/motif-ISDA.pdf
https://dblp.uni-trier.de/db/conf/isda/isda2009.html#GeraciPR09
https://ieeexplore.ieee.org/document/5364851/
http://dblp.uni-trier.de/db/conf/isda/isda2009.html#GeraciPR09
http://ieeexplore.ieee.org/document/5364851/
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005364851
https://hdl.handle.net/20.500.14243/75927