Alexander Zien
Research Subjects
Alexander Zien has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
Ralf Zimmer
Schloss Birlinghoven SCAI -Institute for Algorithms and Scientific Computing GMD -German National Research Center for Information Technology 53754 Sankt Augustin Germany
2 shared publicationsThomas Lengauer
Schloss Birlinghoven SCAI -Institute for Algorithms and Scientific Computing GMD -German National Research Center for Information Technology 53754 Sankt Augustin Germany
2 shared publications- Bernhard Schölkopf
ETH Zurich
1 shared publication - Gunnar Rätsch
Institute for Machine Learning, Department of Computer Science, ETH Zurich, Switzerland
1 shared publication K.-R. Müller
1 shared publicationR Küffner
1 shared publication
Latest Publications
- Open Access
- 1 June 2001
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 17 (suppl_1) , S323-S331
Centralization: a new method for the normalization of gene expression data
Microarrays measure values that are approximately proportional to the numbers of copies of different mRNA molecules in samples. Due to technical difficulties, the constant of proportionality between the measured intensities and the numbers of mRNA copies per cell is unknown and may vary for different arrays. Usually, the data are normalized (i.e., array-wise multiplied by appropriate factors) in order to compensate for this effect and to enable informative comparisons between different experiments. Centralization is a new two-step method for the computation of such normalization factors that is both biologically better motivated and more robust than standard approaches. First, for each pair of arrays the quotient of the constants of proportionality is estimated. Second, from the resulting matrix of pairwise quotients an optimally consistent scaling of the samples is computed. Contact: Alexander.Zien@gmd.de
- 1 June 2001
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 17 (suppl_1) , S323-S331
Open AccessCentralization: a new method for the normalization of gene expression data
Microarrays measure values that are approximately proportional to the numbers of copies of different mRNA molecules in samples. Due to technical difficulties, the constant of proportionality between the measured intensities and the numbers of mRNA copies per cell is unknown and may vary for different arrays. Usually, the data are normalized (i.e., array-wise multiplied by appropriate factors) in order to compensate for this effect and to enable informative comparisons between different experiments. Centralization is a new two-step method for the computation of such normalization factors that is both biologically better motivated and more robust than standard approaches. First, for each pair of arrays the quotient of the constants of proportionality is estimated. Second, from the resulting matrix of pairwise quotients an optimally consistent scaling of the samples is computed. Contact: Alexander.Zien@gmd.de
- Open Access
- 1 September 2000
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 16 (9) , 799-807
Engineering support vector machine kernels that recognize translation initiation sites
Motivation: In order to extract protein sequences from nucleotide sequences, it is an important step to recognize points at which regions start that code for proteins. These points are called translation initiation sites (TIS). Results: The task of finding TIS can be modeled as a classification problem. We demonstrate the applicability of support vector machines for this task, and show how to incorporate prior biological knowledge by engineering an appropriate kernel function. With the described techniques the recognition performance can be improved by 26% over leading existing approaches. We provide evidence that existing related methods (e.g. ESTScan) could profit from advanced TIS recognition. Contact: {Alexander.Zien,Gunnar.Raetsch,Sebastian. Mika}@gmd.de; bsc@microsoft.com To whom correspondence should be addressed.
- 1 September 2000
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 16 (9) , 799-807
Open AccessEngineering support vector machine kernels that recognize translation initiation sites
Motivation: In order to extract protein sequences from nucleotide sequences, it is an important step to recognize points at which regions start that code for proteins. These points are called translation initiation sites (TIS). Results: The task of finding TIS can be modeled as a classification problem. We demonstrate the applicability of support vector machines for this task, and show how to incorporate prior biological knowledge by engineering an appropriate kernel function. With the described techniques the recognition performance can be improved by 26% over leading existing approaches. We provide evidence that existing related methods (e.g. ESTScan) could profit from advanced TIS recognition. Contact: {Alexander.Zien,Gunnar.Raetsch,Sebastian. Mika}@gmd.de; bsc@microsoft.com To whom correspondence should be addressed.
- 1 August 2000
- Published by SAGE Publications in Journal of Computational Biology
- Vol. 7 (3-4) , 483-501
A Simple Iterative Approach to Parameter Optimization
Various bioinformatics problems require optimizing several different properties simultaneously. For example, in the protein threading problem, a scoring function combines the values for different parameters of possible sequence-to-structure alignments into a single score to allow for unambiguous optimization. In this context, an essential question is how each property should be weighted. As the native structures are known for some sequences, a partial ordering on optimal alignments to other structures, e.g., derived from structural comparisons, may be used to adjust the weights. To resolve the arising interdependence of weights and computed solutions, we propose a heuristic approach: iterating the computation of solutions (here, threading alignments) given the weights and the estimation of optimal weights of the scoring function given these solutions via systematic calibration methods. For our application (i.e., threading), this iterative approach results in structurally meaningful weights that significantly improve performance on both the training and the test data sets. In addition, the optimized parameters show significant improvements on the recognition rate for a grossly enlarged comprehensive benchmark, a modified recognition protocol as well as modified alignment types (local instead of global and profiles instead of single sequences). These results show the general validity of the optimized weights for the given threading program and the associated scoring contributions.
- 1 August 2000
- Published by SAGE Publications in Journal of Computational Biology
- Vol. 7 (3-4) , 483-501
A Simple Iterative Approach to Parameter Optimization
Various bioinformatics problems require optimizing several different properties simultaneously. For example, in the protein threading problem, a scoring function combines the values for different parameters of possible sequence-to-structure alignments into a single score to allow for unambiguous optimization. In this context, an essential question is how each property should be weighted. As the native structures are known for some sequences, a partial ordering on optimal alignments to other structures, e.g., derived from structural comparisons, may be used to adjust the weights. To resolve the arising interdependence of weights and computed solutions, we propose a heuristic approach: iterating the computation of solutions (here, threading alignments) given the weights and the estimation of optimal weights of the scoring function given these solutions via systematic calibration methods. For our application (i.e., threading), this iterative approach results in structurally meaningful weights that significantly improve performance on both the training and the test data sets. In addition, the optimized parameters show significant improvements on the recognition rate for a grossly enlarged comprehensive benchmark, a modified recognition protocol as well as modified alignment types (local instead of global and profiles instead of single sequences). These results show the general validity of the optimized weights for the given threading program and the associated scoring contributions.
- 1 January 2000
- Vol. 8, 407-17
Analysis of gene expression data with pathway scores.
We present a new approach for the evaluation of gene expression data. The basic idea is to generate biologically possible pathways and to score them with respect to gene expression measurements. We suggest sample scoring functions for different problem specifications. We assess the significance of the scores for the investigated pathways by comparison to a number of scores for random pathways. We show that simple scoring functions can assign statistically significant scores to biologically relevant pathways. This suggests that the combination of appropriate scoring functions with the systematic generation of pathways can be used in order to select the most interesting pathways based on gene expression measurements.
- 1 January 2000
- Vol. 8, 407-17
Analysis of gene expression data with pathway scores.
We present a new approach for the evaluation of gene expression data. The basic idea is to generate biologically possible pathways and to score them with respect to gene expression measurements. We suggest sample scoring functions for different problem specifications. We assess the significance of the scores for the investigated pathways by comparison to a number of scores for random pathways. We show that simple scoring functions can assign statistically significant scores to biologically relevant pathways. This suggests that the combination of appropriate scoring functions with the systematic generation of pathways can be used in order to select the most interesting pathways based on gene expression measurements.