%0 Conference Paper %1 conf/cpm/HortonF05 %A Horton, Paul %A Fujibuchi, Wataru %B CPM %D 2005 %E Apostolico, Alberto %E Crochemore, Maxime %E Park, Kunsoo %I Springer %K dblp %P 219-228 %T An Upper Bound on the Hardness of Exact Matrix Based Motif Discovery. %U http://dblp.uni-trier.de/db/conf/cpm/cpm2005.html#HortonF05 %V 3537 %@ 3-540-26201-6

@inproceedings{conf/cpm/HortonF05, added-at = {2017-05-26T00:00:00.000+0200}, author = {Horton, Paul and Fujibuchi, Wataru}, biburl = {https://www.bibsonomy.org/bibtex/2acb189175b88e6a5c97f361fcd516a9a/dblp}, booktitle = {CPM}, crossref = {conf/cpm/2005}, editor = {Apostolico, Alberto and Crochemore, Maxime and Park, Kunsoo}, ee = {https://doi.org/10.1007/11496656_19}, interhash = {1b5177747573f5f0af2efd4757417107}, intrahash = {acb189175b88e6a5c97f361fcd516a9a}, isbn = {3-540-26201-6}, keywords = {dblp}, pages = {219-228}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T13:48:29.000+0200}, title = {An Upper Bound on the Hardness of Exact Matrix Based Motif Discovery.}, url = {http://dblp.uni-trier.de/db/conf/cpm/cpm2005.html#HortonF05}, volume = 3537, year = 2005 }