Evidence map›Paper›PMID 16100379›Full record

ArticleNucleic acids research2005

Using multiple alignments to improve seeded local alignment algorithms.

Jason Flannick, Serafim Batzoglou

Abstract readEvaluation Study
In one paragraph

Article in Nucleic acids research, 2005. 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
–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

2 citing papers in PubMed.

  1. Article
  2. 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.

Jason FlannickDepartment of Computer Science, Stanford University, Stanford, CA 94304, USA. flannick@cs.stanford.edu
Serafim Batzoglou

Funding

The Stanford ENCODE ProjectU01HG003162 · NHGRI · STANFORD UNIVERSITY · PI MYERS, RICHARD M · 2003 to 2006
$11.2M
NHGRI NIH HHS U01 HG003162NHGRI NIH HHS U01-HG003162
6 · The paper itself

Abstract

Multiple alignments among genomes are becoming increasingly prevalent. This trend motivates the development of tools for efficient homology search between a query sequence and a database of multiple alignments. In this paper, we present an algorithm that uses the information implicit in a multiple alignment to dynamically build an index that is weighted most heavily towards the promising regions of the multiple alignment. We have implemented Typhon, a local alignment tool that incorporates our indexing algorithm, which our test results show to be more sensitive than algorithms that index only a sequence. This suggests that when applied on a whole-genome scale, Typhon should provide improved homology searches in time comparable to existing algorithms.

Indexed as

AlgorithmsSoftwareAnimalsBase SequenceDatabases, Nucleic AcidGenomicsHumansSequence Alignment

Identifiers

PMID16100379
PMCPMC1185574

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.