Evidence map›Paper›PMID 19709416›Full record

ArticleBMC genetics2009

Single-feature polymorphism discovery by computing probe affinity shape powers.

Wayne Wenzhong Xu, Seungho Cho, S Samuel Yang, Yung-Tsi Bolon, Hatice Bilgic, Haiyan Jia, Yanwen Xiong, Gary J Muehlbauer

Abstract readComparative Study
In one paragraph

Article in BMC genetics, 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. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. 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

8 authors.

Wayne Wenzhong XuSupercomputing Institute for Advanced Computational Research, University of Minnesota, Minnesota, MN 55455, USA. wxu@msi.umn.edu
Seungho Cho
S Samuel Yang
Yung-Tsi Bolon
Hatice Bilgic
Haiyan Jia
Yanwen Xiong
Gary J Muehlbauer

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundSingle-feature polymorphism (SFP) discovery is a rapid and cost-effective approach to identify DNA polymorphisms. However, high false positive rates and/or low sensitivity are prevalent in previously described SFP detection methods. This work presents a new computing method for SFP discovery.

resultsThe probe affinity differences and affinity shape powers formed by the neighboring probes in each probe set were computed into SFP weight scores. This method was validated by known sequence information and was comprehensively compared with previously-reported methods using the same datasets. A web application using this algorithm has been implemented for SFP detection. Using this method, we identified 364 SFPs in a barley near-isogenic line pair carrying either the wild type or the mutant uniculm2 (cul2) allele. Most of the SFP polymorphisms were identified on chromosome 6H in the vicinity of the Cul2 locus.

conclusionThis SFP discovery method exhibits better performance in specificity and sensitivity over previously-reported methods. It can be used for other organisms for which GeneChip technology is available. The web-based tool will facilitate SFP discovery. The 364 SFPs discovered in a barley near-isogenic line pair provide a set of genetic markers for fine mapping and future map-based cloning of the Cul2 locus.

Indexed as

Polymorphism, Single NucleotideChromosome MappingChromosomes, PlantComputational BiologyDNA, PlantDNA ProbesHordeumSensitivity and SpecificitySequence Analysis, DNADNA, PlantDNA Probes

Identifiers

PMID19709416
PMCPMC2746803

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.