Evidence map›Paper›PMID 19335894›Full record

ArticleBMC bioinformatics2009

Biological sequences as pictures: a generic two dimensional solution for iterated maps.

Jonas S Almeida, Susana Vinga

Abstract read
In one paragraph

Article in BMC bioinformatics, 2009. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 10 papers.

0numbers the graph read from it
0cells of the map it votes in
10citing papers in PubMed
–field-weighted citation impact
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

10 citing papers in PubMed.

  1. Modeling Human Frailty with a Smart Home-Based Approximation of Entropy.ACM-BCB ... ... : the ... ACM Conference on Bioinformatics, Computational Biology and Biomedicine. ACM Conference on Bioinformatics, Computational Biology and Biomedicine · 2023
    Article
  2. Chaos game representation and its applications in bioinformatics.Computational and structural biotechnology journal · 2021
    Review
  3. Article
  4. Article
  5. Sequence analysis by iterated maps, a review.Briefings in bioinformatics · 2014
    Review
  6. Review
  7. Fractal MapReduce decomposition of sequence alignment.Algorithms for molecular biology : AMB · 2012
    Article
  8. Article
  9. Article
  10. 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.

Jonas S AlmeidaDept Bioinformatics and Computational Biology, University of Texas MD Anderson Cancer Center, Houston, TX, USA. jalmeida@mathbiol.org
Susana Vinga

Funding

NHLBI PROTEOMICS INITIATIVE-N01HV28181N01HV028181 · HV · MEDICAL UNIV OF SOUTH CAROLINA · PI KNAPP, DANIEL · 2002 to 2006
–
NHLBI NIH HHS N01 HV028181NHLBI NIH HHS N01-HV-28181
6 · The paper itself

Abstract

backgroundRepresenting symbolic sequences graphically using iterated maps has enjoyed an enduring popularity since it was first proposed in Jeffrey 1990 as chaos game representation (CGR). The usefulness of this representation goes beyond the convenience of a scale independent representation. It provides a variable memory length representation of transition. This includes the representation of succession with non-integer order, which comes with the promise of generalizing Markovian formalisms. The original proposal targeted genomic sequences only but since then several generalizations have been proposed, many specifically designed to handle protein data.

resultsThe challenge of a general solution is that of deriving a bijective transformation of symbolic sequences into bi-dimensional planes. More specifically, it requires the regular fractal nesting of polygons. A first attempt at a general solution was proposed by Fiser 1994 by using non-overlapping circles that contain the polygons. This was used as a starting point to identify a more efficient solution where the encapsulating circles can overlap without the same happening for the sequence maps which are circumscribed to fractal polygon domains.

conclusionWe identified the optimal inscribed packing solution for iterated maps of any Biological sequence, indeed of any symbolic sequence. The new solution maintains the prized bijective mapping property and includes the Sierpinski triangle and the CGR square as particular solutions of the more encompassing formulation.

Indexed as

AlgorithmsComputational BiologyPattern Recognition, AutomatedSequence AnalysisSoftware

Identifiers

PMID19335894
PMCPMC2678093

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.