Schaller, David

1. Complexity of modification problems for best match graphs
   2020/06/30 by Schaller, David, Stadler, Peter F., Hellmuth, Marc · 2 citations
   #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Biological sciences #FOS: Computer and information sciences #Populations and Evolution (q-bio.PE)
2. Best Match Graphs with Binary Trees
   2020/11/01 by Schaller, David, Geiß, Manuela, Hellmuth, Marc +1 · 1 citation
   #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Biological sciences #FOS: Computer and information sciences #FOS: Mathematics #Populations and Evolution (q-bio.PE)
3. Heuristic Algorithms for Best Match Graph Editing
   2021/03/10 by Schaller, David, Geiß, Manuela, Hellmuth, Marc +1 · 1 citation
   #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Biological sciences #FOS: Computer and information sciences #FOS: Mathematics #Populations and Evolution (q-bio.PE)
4. Quasi-Best Match Graphs
   2021/09/21 by Korchmaros, Annachiara, Schaller, David, Hellmuth, Marc +1 · 1 citation
   #Combinatorics (math.CO) #FOS: Biological sciences #FOS: Mathematics #Populations and Evolution (q-bio.PE)