Evidence map›Paper›PMID 22977183›Full record

ArticleNucleic acids research2013

Direct mapping of symbolic DNA sequence into frequency domain in global repeat map algorithm.

Matko Glunčić, Vladimir Paar

Open access · goldAbstract read
In one paragraph

Article in Nucleic acids research, 2013. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 17 papers.

0numbers the graph read from it
0cells of the map it votes in
17citing papers in PubMed
0.4field-weighted citation impact, top 37% 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

17 citing papers in PubMed, 36 citations in OpenAlex.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. Article
  12. Article
  13. Article
  14. Satellite DNA evolution: old ideas, new approaches.Current opinion in genetics & development · 2018
    Review
  15. Article
  16. Article
  17. 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

2 authors at 2 institutions in 1 country.

Matko GlunčićFaculty of Science, University of Zagreb, Bijenička 32 and Croatian Academy of Sciences and Arts, Zrinski trg 11, 10000 Zagreb, Croatia. matko@phy.hr
Vladimir Paar
Croatian Academy of Sciences and Arts · HRUniversity of Zagreb · HR

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The main feature of global repeat map (GRM) algorithm (www.hazu.hr/grm/software/win/grm2012.exe) is its ability to identify a broad variety of repeats of unbounded length that can be arbitrarily distant in sequences as large as human chromosomes. The efficacy is due to the use of complete set of a K-string ensemble which enables a new method of direct mapping of symbolic DNA sequence into frequency domain, with straightforward identification of repeats as peaks in GRM diagram. In this way, we obtain very fast, efficient and highly automatized repeat finding tool. The method is robust to substitutions and insertions/deletions, as well as to various complexities of the sequence pattern. We present several case studies of GRM use, in order to illustrate its capabilities: identification of α-satellite tandem repeats and higher order repeats (HORs), identification of Alu dispersed repeats and of Alu tandems, identification of Period 3 pattern in exons, implementation of 'magnifying glass' effect, identification of complex HOR pattern, identification of inter-tandem transitional dispersed repeat sequences and identification of long segmental duplications. GRM algorithm is convenient for use, in particular, in cases of large repeat units, of highly mutated and/or complex repeats, and of global repeat maps for large genomic sequences (chromosomes and genomes).

Indexed as

AlgorithmsRepetitive Sequences, Nucleic AcidAlu ElementsChromosome DuplicationChromosomes, Human, Pair 7Chromosomes, Human, YDNADNA, SatelliteGenomicsHumansSequence Analysis, DNATandem Repeat SequencesDNADNA, Satellite

Identifiers

PMID22977183
PMCPMC3592446
OpenAlexW2153199777

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC
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.