Name
Papers
Collaborators
PETER F. STADLER
82
187
Citations 
PageRank 
Referers 
256
62.77
555
Referees 
References 
723
378
Search Limit
100723
Title
Citations
PageRank
Year
From modular decomposition trees to rooted median graphs.00.342022
Complete edge-colored permutation graphs.00.342022
Generic Context-Aware Group Contributions00.342022
What makes a reaction network “chemical”?00.342022
BioAutoML: automated feature engineering and metalearning to predict noncoding RNAs in bacteria00.342022
Compatibility of partitions with trees, hierarchies, and split systems00.342022
Combining Orthology and Xenology Data in a Common Phylogenetic Tree.00.342021
Cut Vertex Transit Functions of Hypergraphs.00.342021
Cograph editing: Merging modules is equivalent to editing P_4s.00.342020
Efficient Algorithms for Co-folding of Multiple RNAs.00.342020
Computational Simulations for Cyclizations Catalyzed by Plant Monoterpene Synthases.00.342020
Economic Genome Assembly from Low Coverage Illumina and Nanopore Data00.342020
Anti-CD3 Stimulated T Cell Transcriptome Reveals Novel ncRNAs and Correlates with a Suppressive Profile.00.342020
Bi-alignments as Models of Incongruent Evolution of RNA Sequence and Secondary Structure.00.342019
Axiomatic characterization of transit functions of weak hierarchies.00.342019
A General Framework for Exact Partially Local Alignments00.342019
Big Data Competence Center ScaDS Dresden/Leipzig: Overview and selected research activities.10.352019
Alignments as Compositional Structures.00.342018
A short note on undirected fitch graphs00.342018
Merging Modules is equivalent to Editing P4's.00.342017
A Short Note on Undirected Fitch Graphs.10.362017
A Survey on Hypergraph Products (Erratum).00.342017
From event labeled gene trees to species trees.00.342017
Forbidden Time Travel: Characterization of Time-Consistent Tree Reconciliation Maps.30.382017
Topological Representation of the Transit Sets of k-Point Crossover Operators.00.342017
Algorithmic Cheminformatics (Dagstuhl Seminar 17452).00.342017
Read mapping.00.342016
Techniques for the Cograph Editing Problem: Module Merge is equivalent to Editing P4s10.362015
Connectivity Spaces.00.342015
The genome of the recently domesticated crop plant sugar beet (Beta vulgaris) Open.00.342014
Algorithmic Cheminformatics (Dagstuhl Seminar 14452).00.342014
The Relaxed Square Property.00.342014
Comparative Detection Of Processed Small Rnas In Archaea00.342014
Distribution of Graph-Distances in Boltzmann Ensembles of RNA Secondary Structures.10.352013
Square Property, Equitable Partitions, and Product-like Graphs00.342013
Hidden treasures in unspliced EST data.00.342012
RNA Folding Algorithms with G-Quadruplexes.10.362012
In Silico Evolution of Early Metabolism20.562011
Maximizing output and recognizing autocatalysis in chemical reaction networks is NP-complete90.812011
Evolution of the Long Non-coding RNAs MALAT1 and MENbeta/epsilon00.342010
Advances in Bioinformatics and Computational Biology, 5th Brazilian Symposium on Bioinformatics, BSB 2010, Rio de Janeiro, Brazil, August 31-September 3, 2010. Proceedings101.142010
In Silico Evolution of Early Metabolism.00.342010
Quantitative Comparison of Genomic-Wide Protein Domain Distributions00.342010
Identification and classification of small RNAs in transcriptome sequence data.50.542010
Automatic Classification of Embryonic Fruit Fly Gene Expression Patterns10.382009
Discovering Temporal Patterns of Differential Gene Expression in Microarray Time Series10.392009
A topological approach to chemical organizations.91.592009
German Conference on Bioinformatics 2009, 28th to 30th September 2009, Martin Luther University Halle-Wittenberg, Germany192.792009
Local Algorithms for the Prime Factorization of Strong Product Graphs60.512009
A note on quasi-robust cycle bases20.382009
  • 1
  • 2