%0 Journal Article %1 journals/jda/HortonF07 %A Horton, Paul %A Fujibuchi, Wataru %D 2007 %J J. Discrete Algorithms %K dblp %N 4 %P 706-713 %T An upper bound on the hardness of exact matrix based motif discovery. %U http://dblp.uni-trier.de/db/journals/jda/jda5.html#HortonF07 %V 5

@article{journals/jda/HortonF07, added-at = {2021-02-16T00:00:00.000+0100}, author = {Horton, Paul and Fujibuchi, Wataru}, biburl = {https://www.bibsonomy.org/bibtex/26aa5f569c034e7d4021df279e1d367db/dblp}, ee = {https://doi.org/10.1016/j.jda.2006.10.006}, interhash = {279e7c1786f2a9550d6e4b7550e2a972}, intrahash = {6aa5f569c034e7d4021df279e1d367db}, journal = {J. Discrete Algorithms}, keywords = {dblp}, number = 4, pages = {706-713}, timestamp = {2024-04-08T20:30:53.000+0200}, title = {An upper bound on the hardness of exact matrix based motif discovery.}, url = {http://dblp.uni-trier.de/db/journals/jda/jda5.html#HortonF07}, volume = 5, year = 2007 }