Computer Science – Computational Complexity
Scientific paper
2008-02-04
Computer Science
Computational Complexity
Published in Journal of Discrete Algorithms
Scientific paper
10.1016/j.jda.2009.12.001
This paper has been withdrawn by the corresponding author because the newest
version is now published in Journal of Discrete Algorithms.
Michael Morris
Nicolas Francois
Ukkonen Esko
No associations
LandOfFree
On the complexity of finding gapped motifs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the complexity of finding gapped motifs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the complexity of finding gapped motifs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-236533