Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Thomas Lübberstedt

dblp:51/7235 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2019
0000-0002-0526-0798ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 3

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › genomics
genome-wide association study
0.412019
GWASpro: a high-performance genome-wide association analysis server · Bioinform. 2019
Bioinformatics and computational biology
genomics
0.412019
GWASpro: a high-performance genome-wide association analysis server · Bioinform. 2019
Bioinformatics and computational biology › statistical genetics
linear mixed model
0.412019
GWASpro: a high-performance genome-wide association analysis server · Bioinform. 2019

Methods — techniques the papers use, named apart from their topics

linear mixed model · 0.4
YearPublicationVenuePosition
2019 GWASpro: a high-performance genome-wide association analysis server
abstract
SUMMARY: We present GWASpro, a high-performance web server for the analyses of large-scale genome-wide association studies (GWAS). GWASpro was developed to provide data analyses for large-scale molecular genetic data, coupled with complex replicated experimental designs such as found in plant science investigations and to overcome the steep learning curves of existing GWAS software tools. GWASpro supports building complex design matrices, by which complex experimental designs that may include replications, treatments, locations and times, can be accounted for in the linear mixed model. GWASpro is optimized to handle GWAS data that may consist of up to 10 million markers and 10 000 samples from replicable lines or hybrids. GWASpro provides an interface that significantly reduces the learning curve for new GWAS investigators. AVAILABILITY AND IMPLEMENTATION: GWASpro is freely available at https://bioinfo.noble.org/GWASPRO. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Bongsong Kim, Xinbin Dai, Zhaohong Zhuang, Darlene L. Sanchez, Thomas Lübberstedt, Yun Kang, Michael K. Udvardi, William D. Beavis, Shizhong Xu, Patrick Xuechun Zhao
Bioinform.6
2012 PollenCALC: Software for estimation of pollen compatibility of self-incompatible allo- and autotetraploid species
abstract
BACKGROUND: Self-incompatibility (SI) is a biological mechanism to avoid inbreeding in allogamous plants. In grasses, this mechanism is controlled by a two-locus system (S-Z). Calculation of male and female gamete frequencies is complex for tetraploid species. We are not aware of any software available for predicting pollen haplotype frequencies and pollen compatibility in tetraploid species. RESULTS: PollenCALC is a software tool written in C++ programming language that can predict pollen compatibility percentages for polyploid species with a two-locus (S, Z) self-incompatibility system. The program predicts pollen genotypes and frequencies based on defined meiotic parameters for allo- or autotetraploid species with a gametophytic S-Z SI system. These predictions can be used to obtain expected values for for diploid and for (allo- or autotetraploidy SI grasses. CONCLUSION: The information provided by this calculator can be used to predict compatibility of pair-crosses in plant breeding applications, to analyze segregation distortion for S and Z genes, as well as linked markers in mapping populations, hypothesis testing of the number of S and Z alleles in a pair cross, and the underlying genetic model.
Andrea Arias Aguirre, Bernd Wollenweber, Ursula K. Frei, Thomas Lübberstedt
BMC Bioinform.4
2009 "PolyMin": software for identification of the minimum number of polymorphisms required for haplotype and genotype differentiation
abstract
BACKGROUND: Analysis of allelic variation for relevant genes and monitoring chromosome segment transmission during selection are important approaches in plant breeding and ecology. To minimize the number of required molecular markers for this purpose is crucial due to cost and time constraints. To date, software for identification of the minimum number of required markers has been optimized for human genetics and is only partly matching the needs of plant scientists and breeders. In addition, different software packages with insufficient interoperability need to be combined to extract this information from available allele sequence data, resulting in an error-prone multi-step process of data handling. RESULTS: PolyMin, a computer program combining the detection of a minimum set of single nucleotide polymorphisms (SNPs) and/or insertions/deletions (INDELs) necessary for allele differentiation with the subsequent genotype differentiation in plant populations has been developed. Its efficiency in finding minimum sets of polymorphisms is comparable to other available program packages. CONCLUSION: A computer program detecting the minimum number of SNPs for haplotype discrimination and subsequent genotype differentiation has been developed, and its performance compared to other relevant software. The main advantages of PolyMin, especially for plant scientists, is the integration of procedures from sequence analysis to polymorphism selection within a single program, including both haplotype and genotype differentiation.
Ursula K. Frei, Bernd Wollenweber, Thomas Lübberstedt
BMC Bioinform.3