On the complexity of finding gapped motifs
Computational Complexity
2010-09-02 v6 Discrete Mathematics
Abstract
This paper has been withdrawn by the corresponding author because the newest version is now published in Journal of Discrete Algorithms.
Cite
@article{arxiv.0802.0314,
title = {On the complexity of finding gapped motifs},
author = {Morris Michael and Francois Nicolas and Esko Ukkonen},
journal= {arXiv preprint arXiv:0802.0314},
year = {2010}
}
Comments
Published in Journal of Discrete Algorithms