Evidence map›Paper›PMID 17713591›Full record

ArticleEURASIP journal on bioinformatics & systems biology2007

A novel signal processing measure to identify exact and inexact tandem repeat patterns in DNA sequences.

Ravi Gupta, Divya Sarthi, Ankush Mittal, Kuldip Singh

Open access · greenAbstract read
In one paragraph

Article in EURASIP journal on bioinformatics & systems biology, 2007. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 9 papers.

0numbers the graph read from it
0cells of the map it votes in
9citing papers in PubMed
0.4field-weighted citation impact, top 39% of its field
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

9 citing papers in PubMed, 51 citations in OpenAlex.

  1. Article
  2. Finding long tandem repeats in long noisy reads.Bioinformatics (Oxford, England) · 2021
    Article
  3. Article
  4. Article
  5. Article
  6. Searching microsatellites in DNA sequences: approaches used and tools developed.Physiology and molecular biology of plants : an international journal of functional plant biology · 2012
    Article
  7. Article
  8. Article
  9. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors at 1 institution in 1 country.

Ravi GuptaDepartment of Electronics and Computer Engineering, Indian Institute of Technology-Roorkee, Roorkee, Uttaranchal, India.
Divya Sarthi
Ankush Mittal
Kuldip Singh
Indian Institute of Technology Roorkee · IN

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The identification and analysis of repetitive patterns are active areas of biological and computational research. Tandem repeats in telomeres play a role in cancer and hypervariable trinucleotide tandem repeats are linked to over a dozen major neurodegenerative genetic disorders. In this paper, we present an algorithm to identify the exact and inexact repeat patterns in DNA sequences based on orthogonal exactly periodic subspace decomposition technique. Using the new measure our algorithm resolves the problems like whether the repeat pattern is of period P or its multiple (i.e., 2P, 3P, etc.), and several other problems that were present in previous signal-processing-based algorithms. We present an efficient algorithm of O(NL(w) log L(w)), where N is the length of DNA sequence and L(w) is the window length, for identifying repeats. The algorithm operates in two stages. In the first stage, each nucleotide is analyzed separately for periodicity, and in the second stage, the periodic information of each nucleotide is combined together to identify the tandem repeats. Datasets having exact and inexact repeats were taken up for the experimental purpose. The experimental result shows the effectiveness of the approach.

Identifiers

PMID17713591
PMCPMC3171338
OpenAlexW1972624199

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.