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

Erwin Holzhauser

dblp:190/9965 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2019
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author

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
2 papers
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
genomics
0.412019
Efficient haplotype matching between a query and a panel for genealogical search · Bioinform. 2019
Bioinformatics and computational biology › statistical genetics › haplotype analysis
haplotype matching
0.412019
Efficient haplotype matching between a query and a panel for genealogical search · Bioinform. 2019
Bioinformatics and computational biology › RNA biology › RNA analysis › RNA bioinformatics
RNA 3D structure alignment
0.212016
WebSTAR3D: a web server for RNA 3D structural alignment · Bioinform. 2016
Bioinformatics and computational biology › structural bioinformatics › nucleic acid structure analysis
RNA structural bioinformatics
0.212016
WebSTAR3D: a web server for RNA 3D structural alignment · Bioinform. 2016

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

virtual insertion · 0.4positional burrows-wheeler transform · 0.4structural superposition · 0.2
YearPublicationVenuePosition
2019 Efficient haplotype matching between a query and a panel for genealogical search
abstract
MOTIVATION: With the wide availability of whole-genome genotype data, there is an increasing need for conducting genetic genealogical searches efficiently. Computationally, this task amounts to identifying shared DNA segments between a query individual and a very large panel containing millions of haplotypes. The celebrated Positional Burrows-Wheeler Transform (PBWT) data structure is a pre-computed index of the panel that enables constant time matching at each position between one haplotype and an arbitrarily large panel. However, the existing algorithm (Durbin's Algorithm 5) can only identify set-maximal matches, the longest matches ending at any location in a panel, while in real genealogical search scenarios, multiple 'good enough' matches are desired. RESULTS: In this work, we developed two algorithmic extensions of Durbin's Algorithm 5, that can find all L-long matches, matches longer than or equal to a given length L, between a query and a panel. In the first algorithm, PBWT-Query, we introduce 'virtual insertion' of the query into the PBWT matrix of the panel, and then scanning up and down for the PBWT match blocks with length greater than L. In our second algorithm, L-PBWT-Query, we further speed up PBWT-Query by introducing additional data structures that allow us to avoid iterating through blocks of incomplete matches. The efficiency of PBWT-Query and L-PBWT-Query is demonstrated using the simulated data and the UK Biobank data. Our results show that our proposed algorithms can detect related individuals for a given query efficiently in very large cohorts which enables a fast on-line query search. AVAILABILITY AND IMPLEMENTATION: genome.ucf.edu/pbwt-query. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Ardalan Naseri, Erwin Holzhauser, Degui Zhi, Shaojie Zhang 0001
Bioinform.2
2016 WebSTAR3D: a web server for RNA 3D structural alignment
abstract
The WebSTAR3D web server is a user-friendly online interface for the alignment of RNA 3D structures. The website takes as input two files, each of which can be in either PDB or mmCIF format, containing the desired structures to align, via a PDB code or user upload. In return, the user is presented with a visualization of the aligned structures in Jmol or JSmol, along with the corresponding sequence alignment, and the option to download the nucleotide mapping of the structures and a PDB file containing the aligned, superimposed structures. AVAILABILITY AND IMPLEMENTATION: The WebSTAR3D is available at http://rna.ucf.edu/WebSTAR3D CONTACT: [email protected].
Erwin Holzhauser, Ping Ge, Shaojie Zhang 0001
Bioinform.1