Bertil Schmidt
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Bertil Schmidt has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
- Douglas L. Maskell
College of Computing and Data Science, Nanyang Technological University, 50 Nanyang Avenue, Singapore 639798, Singapore
3 shared publications - Weiguo Liu
School of Computer Engineering, Nanyang Technological University, Singapore
3 shared publications - Yongchao Liu
School of Geography and Remote Sensing, Ningbo University, Ningbo, China
3 shared publications Chen Chen
Nanyang Technological University, Singapore
2 shared publicationsHans-Werner Lang
Fachhochschule Flensburg, University of Applied Science, Kanzleistrasse 91–93, 24943 Flensburg, Germany
2 shared publicationsManfred Schimmler
Institut für Informatik, Christian-Albrecht-Universität Kiel, Herman-Rodewald-Strasse 3, 24118 Kiel, Germany
2 shared publications
Latest Publications
- 3 May 2013
- Published by IGI Global Scientific Publishing
- p. 1885-1903
PheGee@Home
PheGee@Home: A Grid-Based Tool for Comparative Genomics: 10.4018/978-1-4666-0879-5.ch809: In this chapter we present PheGee@Home, a grid-based comparative genomics tool that nominates candidate genes responsible for a given phenotype. A phenotype
- 3 May 2013
- Published by IGI Global Scientific Publishing
- p. 1885-1903
PheGee@Home
PheGee@Home: A Grid-Based Tool for Comparative Genomics: 10.4018/978-1-4666-0879-5.ch809: In this chapter we present PheGee@Home, a grid-based comparative genomics tool that nominates candidate genes responsible for a given phenotype. A phenotype
- Open Access
- 1 January 2012
- Published by Elsevier in Procedia Computer Science
- Vol. 9, 1867-1869
Fourth Workshop on using Emerging Parallel Architectures
- 1 January 2012
- Published by Elsevier in Procedia Computer Science
- Vol. 9, 1867-1869
Open AccessFourth Workshop on using Emerging Parallel Architectures
- Open Access
- 15 June 2011
- Published by Springer Nature in BMC Research Notes
- Vol. 4 (1) , 189
Parallel mutual information estimation for inferring gene regulatory networks on GPUs
Mutual information is a measure of similarity between two variables. It has been widely used in various application domains including computational biology, machine learning, statistics, image processing, and financial computing. Previously used simple histogram based mutual information estimators lack the precision in quality compared to kernel based methods. The recently introduced B-spline function based mutual information estimation method is competitive to the kernel based methods in terms of quality but at a lower computational complexity.
- 15 June 2011
- Published by Springer Nature in BMC Research Notes
- Vol. 4 (1) , 189
Open AccessParallel mutual information estimation for inferring gene regulatory networks on GPUs
Mutual information is a measure of similarity between two variables. It has been widely used in various application domains including computational biology, machine learning, statistics, image processing, and financial computing. Previously used simple histogram based mutual information estimators lack the precision in quality compared to kernel based methods. The recently introduced B-spline function based mutual information estimation method is competitive to the kernel based methods in terms of quality but at a lower computational complexity.
- Open Access
- 29 March 2011
- Published by Springer Nature in BMC Bioinformatics
- Vol. 12 (1) , 85
DecGPU: distributed error correction on massively parallel graphics processing units using CUDA and MPI
Next-generation sequencing technologies have led to the high-throughput production of sequence data (reads) at low cost. However, these reads are significantly shorter and more error-prone than conventional Sanger shotgun reads. This poses a challenge for the de novo assembly in terms of assembly quality and scalability for large-scale short read datasets.
- 29 March 2011
- Published by Springer Nature in BMC Bioinformatics
- Vol. 12 (1) , 85
Open AccessDecGPU: distributed error correction on massively parallel graphics processing units using CUDA and MPI
Next-generation sequencing technologies have led to the high-throughput production of sequence data (reads) at low cost. However, these reads are significantly shorter and more error-prone than conventional Sanger shotgun reads. This poses a challenge for the de novo assembly in terms of assembly quality and scalability for large-scale short read datasets.
- 18 January 2011
- Published by IGI Global Scientific Publishing
PheGeeatHome
PheGeeatHome: A Grid-Based Tool for Comparative Genomics: 10.4018/978-1-60566-374-6.ch009: In this chapter we present PheGeeatHome, a grid-based comparative genomics tool that nominates candidate genes responsible for a given phenotype. A phenotype
- 18 January 2011
- Published by IGI Global Scientific Publishing
PheGeeatHome
PheGeeatHome: A Grid-Based Tool for Comparative Genomics: 10.4018/978-1-60566-374-6.ch009: In this chapter we present PheGeeatHome, a grid-based comparative genomics tool that nominates candidate genes responsible for a given phenotype. A phenotype
- Top Cited PapersOpen Access
- 6 April 2010
- Published by Springer Nature in BMC Research Notes
- Vol. 3 (1) , 93
CUDASW++2.0: enhanced Smith-Waterman protein database search on CUDA-enabled GPUs based on SIMT and virtualized SIMD abstractions
Due to its high sensitivity, the Smith-Waterman algorithm is widely used for biological database searches. Unfortunately, the quadratic time complexity of this algorithm makes it highly time-consuming. The exponential growth of biological databases further deteriorates the situation. To accelerate this algorithm, many efforts have been made to develop techniques in high performance architectures, especially the recently emerging many-core architectures and their associated programming models.
- 6 April 2010
- Published by Springer Nature in BMC Research Notes
- Vol. 3 (1) , 93
Top Cited PapersOpen AccessCUDASW++2.0: enhanced Smith-Waterman protein database search on CUDA-enabled GPUs based on SIMT and virtualized SIMD abstractions
Due to its high sensitivity, the Smith-Waterman algorithm is widely used for biological database searches. Unfortunately, the quadratic time complexity of this algorithm makes it highly time-consuming. The exponential growth of biological databases further deteriorates the situation. To accelerate this algorithm, many efforts have been made to develop techniques in high performance architectures, especially the recently emerging many-core architectures and their associated programming models.
- 1 April 2010
- Published by SAGE Publications in Journal of Computational Biology
- Vol. 17 (4) , 603-615
A Parallel Algorithm for Error Correction in High-Throughput Short-Read Data on CUDA-Enabled Graphics Hardware
Emerging DNA sequencing technologies open up exciting new opportunities for genome sequencing by generating read data with a massive throughput. However, produced reads are significantly shorter and more error-prone compared to the traditional Sanger shotgun sequencing method. This poses challenges for de novo DNA fragment assembly algorithms in terms of both accuracy (to deal with short, error-prone reads) and scalability (to deal with very large input data sets). In this article, we present a scalable parallel algorithm for correcting sequencing errors in high-throughput short-read data so that error-free reads can be available before DNA fragment assembly, which is of high importance to many graph-based short-read assembly tools. The algorithm is based on spectral alignment and uses the Compute Unified Device Architecture (CUDA) programming model. To gain efficiency we are taking advantage of the CUDA texture memory using a space-efficient Bloom filter data structure for spectrum membership queries. We have tested the runtime and accuracy of our algorithm using real and simulated Illumina data for different read lengths, error rates, input sizes, and algorithmic parameters. Using a CUDA-enabled mass-produced GPU (available for less than US$400 at any local computer outlet), this results in speedups of 12–84 times for the parallelized error correction, and speedups of 3–63 times for both sequential preprocessing and parallelized error correction compared to the publicly available Euler-SR program. Our implementation is freely available for download from http://cuda-ec.sourceforge.net.
- 1 April 2010
- Published by SAGE Publications in Journal of Computational Biology
- Vol. 17 (4) , 603-615
A Parallel Algorithm for Error Correction in High-Throughput Short-Read Data on CUDA-Enabled Graphics Hardware
Emerging DNA sequencing technologies open up exciting new opportunities for genome sequencing by generating read data with a massive throughput. However, produced reads are significantly shorter and more error-prone compared to the traditional Sanger shotgun sequencing method. This poses challenges for de novo DNA fragment assembly algorithms in terms of both accuracy (to deal with short, error-prone reads) and scalability (to deal with very large input data sets). In this article, we present a scalable parallel algorithm for correcting sequencing errors in high-throughput short-read data so that error-free reads can be available before DNA fragment assembly, which is of high importance to many graph-based short-read assembly tools. The algorithm is based on spectral alignment and uses the Compute Unified Device Architecture (CUDA) programming model. To gain efficiency we are taking advantage of the CUDA texture memory using a space-efficient Bloom filter data structure for spectrum membership queries. We have tested the runtime and accuracy of our algorithm using real and simulated Illumina data for different read lengths, error rates, input sizes, and algorithmic parameters. Using a CUDA-enabled mass-produced GPU (available for less than US$400 at any local computer outlet), this results in speedups of 12–84 times for the parallelized error correction, and speedups of 3–63 times for both sequential preprocessing and parallelized error correction compared to the publicly available Euler-SR program. Our implementation is freely available for download from http://cuda-ec.sourceforge.net.
- Open Access
- 17 June 2009
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 25 (17) , 2279-2280
A fast hybrid short read fragment assembly algorithm
Summary: The shorter and vastly more numerous reads produced by second-generation sequencing technologies require new tools that can assemble massive numbers of reads in reasonable time. Existing short-read assembly tools can be classified into two categories: greedy extension-based and graph-based. While the graph-based approaches are generally superior in terms of assembly quality, the computer resources required for building and storing a huge graph are very high. In this article, we present Taipan, an assembly algorithm which can be viewed as a hybrid of these two approaches. Taipan uses greedy extensions for contig construction but at each step realizes enough of the corresponding read graph to make better decisions as to how assembly should continue. We show that this approach can achieve an assembly quality at least as good as the graph-based approaches used in the popular Edena and Velvet assembly tools using a moderate amount of computing resources. Availability and Implementation: Source code in C running on Linux is freely available at http://taipan.sourceforge.net Contact:asbschmidt@ntu.edu.sg
- 17 June 2009
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 25 (17) , 2279-2280
Open AccessA fast hybrid short read fragment assembly algorithm
Summary: The shorter and vastly more numerous reads produced by second-generation sequencing technologies require new tools that can assemble massive numbers of reads in reasonable time. Existing short-read assembly tools can be classified into two categories: greedy extension-based and graph-based. While the graph-based approaches are generally superior in terms of assembly quality, the computer resources required for building and storing a huge graph are very high. In this article, we present Taipan, an assembly algorithm which can be viewed as a hybrid of these two approaches. Taipan uses greedy extensions for contig construction but at each step realizes enough of the corresponding read graph to make better decisions as to how assembly should continue. We show that this approach can achieve an assembly quality at least as good as the graph-based approaches used in the popular Edena and Velvet assembly tools using a moderate amount of computing resources. Availability and Implementation: Source code in C running on Linux is freely available at http://taipan.sourceforge.net Contact:asbschmidt@ntu.edu.sg
- Top Cited PapersOpen Access
- 1 January 2009
- Published by Springer Nature in BMC Research Notes
- Vol. 2 (1) , 73
CUDASW++: optimizing Smith-Waterman sequence database searches for CUDA-enabled graphics processing units
The Smith-Waterman algorithm is one of the most widely used tools for searching biological sequence databases due to its high sensitivity. Unfortunately, the Smith-Waterman algorithm is computationally demanding, which is further compounded by the exponential growth of sequence databases. The recent emergence of many-core architectures, and their associated programming interfaces, provides an opportunity to accelerate sequence database searches using commonly available and inexpensive hardware.
- 1 January 2009
- Published by Springer Nature in BMC Research Notes
- Vol. 2 (1) , 73
Top Cited PapersOpen AccessCUDASW++: optimizing Smith-Waterman sequence database searches for CUDA-enabled graphics processing units
The Smith-Waterman algorithm is one of the most widely used tools for searching biological sequence databases due to its high sensitivity. Unfortunately, the Smith-Waterman algorithm is computationally demanding, which is further compounded by the exponential growth of sequence databases. The recent emergence of many-core architectures, and their associated programming interfaces, provides an opportunity to accelerate sequence database searches using commonly available and inexpensive hardware.
- Open Access
- 1 January 2009
- Published by Hindawi Limited in Scientific Programming
- Vol. 17 (1) , 97-111
High Performance Protein Sequence Database Scanning on the Cell Broadband Engine
The enormous growth of biological sequence databases has caused bioinformatics to be rapidly moving towards a data-intensive, computational science. As a result, the computational power needed by bioinformatics applications is growing rapidly as well. The recent emergence of low cost parallel multicore accelerator technologies has made it possible to reduce execution times of many bioinformatics applications. In this paper, we demonstrate how the Cell Broadband Engine can be used as a computational platform to accelerate two approaches for protein sequence database scanning: exhaustive and heuristic. We present efficient parallelization techniques for two representative algorithms: the dynamic programming based SmithWaterman algorithm and the popular BLASTP heuristic. Their implementation on a Playstation®3 leads to significant runtime savings compared to corresponding sequential implementations.
- 1 January 2009
- Published by Hindawi Limited in Scientific Programming
- Vol. 17 (1) , 97-111
Open AccessHigh Performance Protein Sequence Database Scanning on the Cell Broadband Engine
The enormous growth of biological sequence databases has caused bioinformatics to be rapidly moving towards a data-intensive, computational science. As a result, the computational power needed by bioinformatics applications is growing rapidly as well. The recent emergence of low cost parallel multicore accelerator technologies has made it possible to reduce execution times of many bioinformatics applications. In this paper, we demonstrate how the Cell Broadband Engine can be used as a computational platform to accelerate two approaches for protein sequence database scanning: exhaustive and heuristic. We present efficient parallelization techniques for two representative algorithms: the dynamic programming based SmithWaterman algorithm and the popular BLASTP heuristic. Their implementation on a Playstation®3 leads to significant runtime savings compared to corresponding sequential implementations.