Research map / Learning theory and algorithms / Submodular and game algorithms
Efficiently Enumerating Substrings with Statistically Significant Frequencies of Locally Optimal Occurrences in Gigantic String
Atsuyoshi Nakamura, Ichigaku Takigawa, Hiroshi Mamitsuka
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use length-dependent supports (p-value 10^-20) instead of fixed minimum support 14 (ablation) | E3SFLOO · D1(0) | F-measure (%): 31.3 -> 99.7 | Improved |
| use length-dependent supports instead of fixed min sup 8 (ablation) | E3SFLOO · D1(0) | F-measure (%): 50.8 -> 99.7 | Improved |
| use length-dependent supports instead of best fixed min sup 5 (ablation) | E3SFLOO · D1(0) | F-measure (%): 68.8 -> 99.7 | Improved |
| lower fixed min support from 14 to 2 (ablation) | ESFLOO-0G.C · D1(0) | precision (%): 98.8 -> 1.3 | Hurt |
| lower fixed min support from 14 to 2 (ablation) | ESFLOO-0G.C · D1(0) | recall (%): 18.6 -> 100.0 | Improved |
| increase replacement noise alpha from 0 to 8 (D1) | E3SFLOO · D1(alpha) | recall (%): 100.0 -> 6.7 | Hurt |
| increase replacement noise alpha from 0 to 8 (D1) | E3SFLOO · D1(alpha) | precision (%): 99.4 -> 99.2 | No clear effect |
| double pattern frequency (D2 instead of D1) at alpha=8 | E3SFLOO · noisy synthetic, alpha=8 | recall (%): 6.7 -> 42.8 | Improved |
| double pattern frequency (D2 instead of D1) at alpha=8 | E3SFLOO · noisy synthetic, alpha=8 | F-measure (%): 12.6 -> 57.7 | Improved |
| increase noise alpha from 0 to 8 (D2) | E3SFLOO · D2(alpha) | F-measure (%): 90.4 -> 57.7 | Hurt |
| parallelize with 64 threads instead of 1 | E3SFLOO · D1(0) | parallel part elapsed time (sec): 161.4 -> 4.7 | Improved |
| parallelize with 64 threads instead of 1 | E3SFLOO · D1(0) | total elapsed time (sec): 176.5 -> 19.4 | Improved |
Closest papers by meaning
- Self-Bounded Prediction Suffix Tree via Approximate String Matching (ICML 2018 · similarity 0.82)
- Induction Meets Biology: Mechanisms of Repeat Detection in Protein Language Models (ICML 2026 · similarity 0.82)
- Clustering Billions of Reads for DNA Data Storage (NeurIPS 2017 · similarity 0.81)
- Absorb & Escape: Overcoming Single Model Limitations in Generating Heterogeneous Genomic Sequences (NeurIPS 2024 · similarity 0.80)
- VQDNA: Unleashing the Power of Vector Quantization for Multi-Species Genomic Sequence Modeling (ICML 2024 · similarity 0.79)
- StringLLM: Understanding the String Processing Capability of Large Language Models (ICLR 2025 · similarity 0.79)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
