ADAPTIVE MACHINE LEARNING TECHNIQUE FOR PERIODICITY DETECTION IN BIOLOGICAL SEQUENCES
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Researchers devoted considerable effort to detect the periodicity in DNA sequences, namely, the DNA segments that wrap the Histone protein. It is anticipated that periodic dinucleotide signals are indicators of certain important spots (like binding regions) within a DNA sequence; they are equally spaced along nucleosomal DNA with approximately 10 base-pair period. Positioned nucleosomes are believed to play an important role in transcriptional regulation and for the organization of chromatin in cell nuclei. In this paper, we describe and apply a dynamic periodicity detection algorithm to discover the periodicity of certain dinucleotides in DNA and Protein sequences. Our algorithm is based on suffix tree as the underlying data structure. The proposed approach is suitable to analyze different kinds of data and can serve different targets. It considers the periodicity of alternative substrings like the three dinucleotides AA/TA/TT, in addition to considering dynamic window to detect the periodicity of certain instances of substrings. We tested the applicability, effectiveness and resilience of the proposed approach to noise as compared to the other existing algorithms described in the literature.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it