On the complexity of finding gapped motifs
classification
💻 cs.CC
cs.DM
keywords
algorithmsauthorbecausebeencomplexitycorrespondingdiscretefinding
read the original abstract
This paper has been withdrawn by the corresponding author because the newest version is now published in Journal of Discrete Algorithms.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.