Evidence map›Paper›PMID 22518086›Full record

ArticleEvolutionary bioinformatics online2012

A lossy compression technique enabling duplication-aware sequence alignment.

Valerio Freschi, Alessandro Bogliolo

Open access · goldAbstract read
In one paragraph

Article in Evolutionary bioinformatics online, 2012. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

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

2 citing papers in PubMed, 5 citations in OpenAlex.

  1. Probabilistic approaches to alignment with tandem repeats.Algorithms for molecular biology : AMB · 2014
    Article
  2. Data compression for sequencing data.Algorithms for molecular biology : AMB · 2013
    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 1 institution in 1 country.

Valerio FreschiDepartment of Base Sciences and Fundamentals, University of Urbino, Italy.
Alessandro Bogliolo
University of Urbino · IT

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

In spite of the recognized importance of tandem duplications in genome evolution, commonly adopted sequence comparison algorithms do not take into account complex mutation events involving more than one residue at the time, since they are not compliant with the underlying assumption of statistical independence of adjacent residues. As a consequence, the presence of tandem repeats in sequences under comparison may impair the biological significance of the resulting alignment. Although solutions have been proposed, repeat-aware sequence alignment is still considered to be an open problem and new efficient and effective methods have been advocated. The present paper describes an alternative lossy compression scheme for genomic sequences which iteratively collapses repeats of increasing length. The resulting approximate representations do not contain tandem duplications, while retaining enough information for making their comparison even more significant than the edit distance between the original sequences. This allows us to exploit traditional alignment algorithms directly on the compressed sequences. Results confirm the validity of the proposed approach for the problem of duplication-aware sequence alignment.

Indexed as

compressionduplicationssequence alignmenttandem repeat

Identifiers

PMID22518086
PMCPMC3327517
OpenAlexW40131888

What OpenQuestion holds

Textmetadata
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.