Research Topics
| Alexander SchliepSummaryAffiliation: Max Planck Institute for Molecular Genetics Country: Germany Publications
| Collaborators
|
Detail Information
Publications
Decoding non-unique oligonucleotide hybridization experiments of targets related by a phylogenetic treeAlexander Schliep
Dept Computational Molecular Biology, Max Planck Institute for Molecular Genetics, Ihnestrasse 63 73, D 14195 Berlin, Germany
Bioinformatics 22:e424-30. 2006..Of great relevance, however, is the problem of identifying the presence of previously unknown targets or of targets that evolve rapidly...
Analyzing gene expression time-coursesAlexander Schliep
Max Planck Institute for Molecular Genetics, Berlin, Germany
IEEE/ACM Trans Comput Biol Bioinform 2:179-93. 2005..A software implementing the method is freely available under the GPL from http://ghmm.org/gql...
Group testing with DNA chips: generating designs and decoding experimentsAlexander Schliep
Department of Computational Molecular Biology, Max Planck Institute for Molecular Genetics, Inestrasse 63 73, D 14195 Berlin, Germany
Proc IEEE Comput Soc Bioinform Conf 2:84-91. 2003..On a data set of 28S rDNA sequences we were able to identify 660 sequences, a substantial improvement over a prior approach using unique probes which only identified 408 sequences...
Clustering cancer gene expression data: a comparative studyMarcilio C P De Souto
Computational Molecular Biology, Max Planck Institute for Molecular Genetics, Berlin, Germany
BMC Bioinformatics 9:497. 2008..The data sets analyzed in this study are available at http://algorithmics.molgen.mpg.de/Supplements/CompCancer/...
Robust inference of groups in gene expression time-courses using mixtures of HMMsAlexander Schliep
Department of Computational Molecular Biology, Max Planck Institute for Molecular Genetics, Berlin, Germany
Bioinformatics 20:i283-9. 2004..A simple approach, partially supervised learning, allows to benefit from prior biological knowledge during the training. Our method allows simultaneous analysis of cyclic and non-cyclic genes and copes well with noise and missing values...
Using hidden Markov models to analyze gene expression time course dataAlexander Schliep
Max Planck Institute for Molecular Genetics, Department of Computational Molecular Biology, Ihnestrasse 73, 14195 Berlin, Germany
Bioinformatics 19:i255-63. 2003..We evaluate the method on published yeast cell cycle and fibroblasts serum response datasets, and compare them, with favorable results, to the autoregressive curves method...
Efficient algorithms for the computational design of optimal tiling arraysAlexander Schliep
Department Computational Molecular Biology, Max Planck Institute for Molecular Genetics, Ihnestrasse 69 73, 14195 Berlin, Germany
IEEE/ACM Trans Comput Biol Bioinform 5:557-67. 2008..A web application is available at http://tileomatic.org...
Context-specific independence mixture modeling for positional weight matricesBenjamin Georgi
Max Planck Institute for Molecular Genetics, Department of Computational Molecular Biology, Ihnestrasse 73, 14195 Berlin, Germany
Bioinformatics 22:e166-73. 2006..However, estimating a conventional mixture distribution for each position will in many cases cause overfitting...
Semi-supervised learning for the identification of syn-expressed genes from fused microarray and in situ image dataIvan G Costa
Department Computational Molecular Biology, Max Planck Institute for Molecular Genetics, Berlin, Germany
BMC Bioinformatics 8:S3. 2007..Complimentary large data sets of in situ RNA hybridization images for different stages of the fly embryo elucidate the spatial expression patterns...
The Graphical Query Language: a tool for analysis of gene expression time-coursesIvan G Costa
Department of Computational Molecular Biology, Max Planck Institute for Molecular Genetics, Ihnestrasse 73, 14195 Berlin, Germany
Bioinformatics 21:2544-5. 2005..AVAILABILITY: The GQL package is freely available under the GNU general public license (GPL) at http://www.ghmm.org/gql..
Partially-supervised protein subclass discovery with simultaneous annotation of functional residuesBenjamin Georgi
Max Planck Institute for Molecular Genetics, Dept, of Computational Molecular Biology, Ihnestrasse 73, 14195 Berlin, Germany
BMC Struct Biol 9:68. 2009..The locations of putative functional residues in known protein structures provide insights into how different substrate specificities are reflected on the protein structure level...
Classifying short gene expression time-courses with Bayesian estimation of piecewise constant functionsChristoph Hafemeister
Department of Computational Molecular Biology, Max Planck Institute for Molecular Genetics, Berlin, Germany
Bioinformatics 27:946-52. 2011..The current state-of-the-art method (SCOW) uses a variant of dynamic time warping and models time series as higher order polynomials (splines)...
Identifying protein complexes directly from high-throughput TAP data with Markov random fieldsWasinee Rungsarityotin
Max Planck Institute for Molecular Genetics, Department of Computational Molecular Biology, Ihnestr, 73, D 14195 Berlin, Germany
BMC Bioinformatics 8:482. 2007..First, they construct an interaction graph from the data, predominantly using heuristics, and subsequently cluster its vertices to identify protein complexes...
Inferring differentiation pathways from gene expressionIvan G Costa
Department of Computational Molecular Biology, Max Planck Institute for Molecular Genetics, Berlin, Germany
Bioinformatics 24:i156-64. 2008..In general, the similarities in the gene expression programs of cell populations reflect the similarities in the differentiation path...
Gene expression trees in lymphoid developmentIvan G Costa
Department of Computational Molecular Biology, Max Planck Institute for Molecular Genetics, Berlin, Germany
BMC Immunol 8:25. 2007....
pGQL: A probabilistic graphical query language for gene expression time coursesRuben Schilling
Max Planck Institute for Molecular Genetics, Department of Computational Biology, Ihnestr, 63 73, 14195 Berlin, Germany
BioData Min 4:9. 2011..abstract:..
New, improved, and practical k-stem sequence similarity measures for probe designAnthony J Macula
Biomathematics Group, SUNY Geneseo, Geneseo, New York 14454, USA
J Comput Biol 15:525-34. 2008....
Optimal robust non-unique probe selection using Integer Linear ProgrammingGunnar W Klau
Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria
Bioinformatics 20:i186-93. 2004..Our preliminary implementation greatly reduces the number of probes needed while preserving the decoding capabilities. AVAILABILITY: http://www.inf.fu-berlin.de/inst/ag-bio..
Selecting signature oligonucleotides to identify organisms using DNA arraysLars Kaderali
Center for Applied Computer Sciences Cologne ZAIK, University of Cologne, Weyertal 80, 50931 Koln, Germany
Bioinformatics 18:1340-9. 2002..The practicability of the algorithms is demonstrated by two case studies: The identification of HIV-1 subtypes, and of 28S rDNA sequences from >or=400 organisms...
