ArticleTAG. Theoretical and applied genetics. Theoretische und angewandte Genetik2009
Single feature polymorphisms between two rice cultivars detected using a median polish method.
Article in TAG. Theoretical and applied genetics. Theoretische und angewandte Genetik, 2009. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 5 papers.
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.
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.
Who cites it
5 citing papers in PubMed, 14 citations in OpenAlex.
- Extracting genotype information of Arabidopsis thaliana recombinant inbred lines from transcript profiles established with high-density oligonucleotide arrays.Plant cell reports · 2017Article
- Article
- Gains in QTL detection using an ultra-high density SNP map based on population sequencing relative to traditional RFLP/SSR markers.PloS one · 2011Article
- Parent-independent genotyping for constructing an ultrahigh-density linkage map based on population sequencing.Proceedings of the National Academy of Sciences of the United States of America · 2010Article
- A white-box approach to microarray probe response characterization: the BaFL pipeline.BMC bioinformatics · 2009Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
9 authors at 1 institution in 1 country.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Expression levels measured in microarrays of oligonucleotide probes have now been adapted as a high throughput approach for identifying DNA sequence variation between genotypes, referred to as single feature polymorphisms (SFPs). Although there have been increasing interests in this approach, there is still need for improving the algorithm in order to achieve high sensitivity and specificity especially with complex genome and large datasets, while maintaining optimal computational performance. We obtained microarray datasets for expression profiles of two rice cultivars and adapted a median polish method to detect SFPs. The analysis identified 6,655 SFPs between two the rice varieties representing 3,131 rice unique genes. We showed that the median polish method has the advantage of avoiding fitting complex linear models thus can be used to analyze complex transcriptome datasets like the ones in this study. The method is also superior in sensitivity, accuracy and computing time requirement compared with two previously used methods. A comparison with data from a resequencing project indicated that 75.6% of the SFPs had SNP supports in the probe regions. Further comparison revealed that SNPs in sequences immediately flanking the probes also had contributions to the detection of SFPs in cases where the probes and the targets had perfectly matched sequences. It was shown that differences in minimum free energies caused by flanking SNPs, which may change the stability of RNA secondary structure, may partly explain the SFPs as detected. These SFPs may facilitate gene discovery in future studies.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
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.