Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
geoffrey e hinton
Romana Höftberger
Claudia Calabrese
Hao Mao
Suman Kumar
Peter Malec
Qiuxia Yang
Chen Ma
Radu Timofte
Kuanrui Yin
Home
/
Author
/
MATTHIAS BERNT
Author Info
Open Visualization
Name
Affiliation
Papers
MATTHIAS BERNT
Parallel Computing and Complex Systems Group, Department of Computer Science, University of Leipzig, Germany
26
Collaborators
Citations
PageRank
33
77
11.06
Referers
Referees
References
134
376
316
Search Limit
100
376
Publications (26 rows)
Collaborators (33 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
An Exact Algorithm for Sorting by Weighted Preserving Genome Rearrangements.
1
0.36
2019
EqualTDRL: illustrating equivalent tandem duplication random loss rearrangements.
0
0.34
2018
Combinatorics of Tandem Duplication Random Loss Mutations on Circular Genomes.
1
0.36
2018
Genome Rearrangement with ILP.
0
0.34
2018
Partially local three-way alignments and the sequence signatures of mitochondrial genome rearrangements.
1
0.35
2017
A Property Preserving Method for Extending a Single-Objective Problem Instance to Multiple Objectives with Specific Correlations.
1
0.35
2016
Refined ranking relations for selection of solutions in multi objective metaheuristics.
3
0.39
2015
Cophylogenetic Reconciliation with ILP
1
0.35
2015
The Influence of Correlated Objectives on Different Types of P-ACO Algorithms.
3
0.38
2014
A common interval guided ACO algorithm for permutation problems
1
0.35
2013
On Weighting Schemes for Gene Order Analysis.
0
0.34
2013
Unifying Parsimonious Tree Reconciliation.
5
0.59
2013
Refined ranking relations for multi objective optimization andapplication to P-ACO
0
0.34
2013
Annotation guided local similarity search in multiple sequences and its application to mitochondrial genomes
0
0.34
2012
Preserving inversion phylogeny reconstruction
0
0.34
2012
A method for computing an inventory of metazoan mitochondrial gene order rearrangements.
10
0.39
2011
Finding all sorting tandem duplication random loss operations
3
0.43
2011
Finding All Sorting Tandem Duplication Random Loss Operations
1
0.37
2009
An Algorithm for Inferring Mitogenome Rearrangements in a Phylogenetic Tree
1
0.36
2008
Solving the Preserving Reversal Median Problem
4
0.76
2008
CREx: inferring genomic rearrangements based on common intervals.
11
0.63
2007
A fast and exact algorithm for the perfect reversal median problem
2
0.43
2007
Using median sets for inferring phylogenetic trees.
13
0.74
2007
Genome rearrangement based on reversals that preserve conserved intervals.
11
0.66
2006
The reversal median problem, common intervals, and mitochondrial gene orders
2
0.39
2006
A parallel algorithm for solving the reversal median problem
2
0.39
2005
1
