Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarc Hellmuth
Person information
- affiliation: Ernst-Moritz-Arndt-Universität Greifswald, Germany
- affiliation: Saarland University, Center for Bioinformatics
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j50]Carsten R. Seemann
, Vincent Moulton, Peter F. Stadler, Marc Hellmuth:
Planar median graphs and cubesquare-graphs. Discret. Appl. Math. 331: 38-58 (2023)- [j49]Annachiara Korchmaros, David Schaller, Marc Hellmuth, Peter F. Stadler:
Quasi-best match graphs. Discret. Appl. Math. 331: 104-125 (2023) - [i56]Marc Hellmuth, Sandhya Thekkumpadan Puthiyaveedu:
On a generalization of median graphs: k-median graphs. CoRR abs/2304.06453 (2023) - [i55]Marc Hellmuth, Peter F. Stadler:
The Theory of Gene Family Histories. CoRR abs/2304.11826 (2023) - 2022
- [j48]Tom Hartmann, Max Bannach, Martin Middendorf, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth:
Complete edge-colored permutation graphs. Adv. Appl. Math. 139: 102377 (2022) - [j47]Anna Lindeberg, Marc Hellmuth:
Construction of k-matchings in graph products. Art Discret. Appl. Math. 6(2): 2 (2022) - [j46]Dulce I. Valdivia, Maribel Hernández-Rosales, Manuela Geiß, Peter F. Stadler, Marc Hellmuth:
Hierarchical and modularly-minimal vertex colorings. Art Discret. Appl. Math. 6(2): 2 (2022) - [j45]Carmen Bruckmann, Peter F. Stadler, Marc Hellmuth:
From modular decomposition trees to rooted median graphs. Discret. Appl. Math. 310: 1-9 (2022) - [j44]Marc Hellmuth, David Schaller, Peter F. Stadler:
Compatibility of partitions with trees, hierarchies, and split systems. Discret. Appl. Math. 314: 265-283 (2022) - [j43]Marc Hellmuth, Guillaume E. Scholz:
From modular decomposition trees to level-1 networks: Pseudo-cographs, polar-cats and prime polar-cats. Discret. Appl. Math. 321: 179-219 (2022) - [j42]Christoph Flamm, Marc Hellmuth, Daniel Merkle, Nikolai Nøjgaard, Peter F. Stadler:
Generic Context-Aware Group Contributions. IEEE ACM Trans. Comput. Biol. Bioinform. 19(1): 429-442 (2022) - [i54]Marc Hellmuth, David Schaller, Peter F. Stadler:
Clustering Systems of Phylogenetic Networks. CoRR abs/2204.13466 (2022) - [i53]Marc Hellmuth, Guillaume E. Scholz:
Resolving Prime Modules: The Structure of Pseudo-cographs and Galled-Tree Explainable Graphs. CoRR abs/2211.16854 (2022) - [i52]David Schaller, Tom Hartmann, Manuel Lafond, Nicolas Wieseke, Marc Hellmuth, Peter F. Stadler:
Relative Timing Information and Orthology in Evolutionary Scenarios. CoRR abs/2212.02201 (2022) - 2021
- [j41]David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler:
Arc-Completion of 2-Colored Best Match Graphs to Binary-Explainable Best Match Graphs. Algorithms 14(4): 110 (2021) - [j40]David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler:
Heuristic algorithms for best match graph editing. Algorithms Mol. Biol. 16(1): 19 (2021) - [j39]David Schaller, Marc Hellmuth, Peter F. Stadler:
A simpler linear-time algorithm for the common refinement of rooted phylogenetic trees on a common leaf set. Algorithms Mol. Biol. 16(1): 23 (2021) - [j38]Marc Hellmuth, Carsten R. Seemann, Peter F. Stadler:
Generalized Fitch Graphs III: Symmetrized Fitch maps and Sets of Symmetric Binary Relations that are explained by Unrooted Edge-labeled Trees. Discret. Math. Theor. Comput. Sci. 23(1) (2021) - [j37]Nikolai Nøjgaard, Walter Fontana, Marc Hellmuth, Daniel Merkle:
Cayley Graphs of Semigroups Applied to Atom Tracking in Chemistry. J. Comput. Biol. 28(7): 701-715 (2021) - [j36]David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler:
Least resolved trees for two-colored best match graphs. J. Graph Algorithms Appl. 25(1): 397-416 (2021) - [j35]David Schaller, Peter F. Stadler, Marc Hellmuth:
Complexity of modification problems for best match graphs. Theor. Comput. Sci. 865: 63-84 (2021) - [c10]David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler:
Best Match Graphs with Binary Trees. AlCoB 2021: 82-93 - [c9]Marc Hellmuth, Mira Michel, Nikolai N. Nøjgaard, David Schaller, Peter F. Stadler:
Combining Orthology and Xenology Data in a Common Phylogenetic Tree. BSB 2021: 53-64 - [i51]David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler:
Least resolved trees for two-colored best match graphs. CoRR abs/2101.07000 (2021) - [i50]David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler:
Arc-Completion of 2-Colored Best Match Graphs to Binary-Explainable Best Match Graphs. CoRR abs/2103.06665 (2021) - [i49]Carmen Bruckmann, Peter F. Stadler, Marc Hellmuth:
From Modular Decomposition Trees to Rooted Median Graphs. CoRR abs/2103.06683 (2021) - [i48]David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler:
Heuristic Algorithms for Best Match Graph Editing. CoRR abs/2103.07280 (2021) - [i47]Marc Hellmuth, David Schaller, Peter F. Stadler:
Compatibility of Partitions, Hierarchies, and Split Systems. CoRR abs/2104.14146 (2021) - [i46]David Schaller, Marc Hellmuth, Peter F. Stadler:
A Linear-Time Algorithm for the Common Refinement of Rooted Phylogenetic Trees on a Common Leaf Set. CoRR abs/2107.00072 (2021) - [i45]Marc Hellmuth, Mira Michel, Nikolai N. Nøjgaard, David Schaller, Peter F. Stadler:
Combining Orthology and Xenology Data in a Common Phylogenetic Tree. CoRR abs/2107.01893 (2021) - [i44]Nikolai Nøjgaard, Walter Fontana, Marc Hellmuth, Daniel Merkle:
Cayley Graphs of Semigroups Applied to Atom Tracking in Chemistry. CoRR abs/2108.04077 (2021) - [i43]Anna Lindeberg, Marc Hellmuth:
Construction of k-matchings and k-regular subgraphs in graph products. CoRR abs/2109.06755 (2021) - [i42]Carsten R. Seemann, Vincent Moulton, Peter F. Stadler, Marc Hellmuth:
Planar Median Graphs and Cubesquare-Graphs. CoRR abs/2110.09346 (2021) - [i41]David Schaller, Marc Hellmuth, Peter F. Stadler:
Orientation of Fitch Graphs and Detection of Horizontal Gene Transfer in Gene Trees. CoRR abs/2112.00403 (2021) - [i40]Marc Hellmuth, Guillaume E. Scholz:
Pseudo-Cographs, Polar-Cats and Level-1 Network Explainable Graphs. CoRR abs/2112.05537 (2021) - 2020
- [j34]Adrian Fritz, Marc Hellmuth, Peter F. Stadler, Nicolas Wieseke:
Cograph editing: Merging modules is equivalent to editing P_4s. Art Discret. Appl. Math. 3(2) (2020) - [j33]Peter F. Stadler, Manuela Geiß, David Schaller, Alitzel López, Marcos González Laffitte, Dulce I. Valdivia, Marc Hellmuth, Maribel Hernandez-Rosales:
From pairs of most similar sequences to phylogenetic best matches. Algorithms Mol. Biol. 15(1): 5 (2020) - [j32]Manuel Lafond, Marc Hellmuth:
Reconstruction of time-consistent species trees. Algorithms Mol. Biol. 15(1): 16 (2020) - [j31]Marc Hellmuth, Carsten R. Seemann, Peter F. Stadler:
Generalized Fitch graphs II: Sets of binary relations that are explained by edge-labeled trees. Discret. Appl. Math. 283: 495-511 (2020) - [j30]Marc Hellmuth, Manuela Geiß, Peter F. Stadler:
Complexity of modification problems for reciprocal best match graphs. Theor. Comput. Sci. 809: 384-393 (2020) - [c8]Marc Hellmuth, Daniel Merkle, Nikolai Nøjgaard:
Atom Tracking Using Cayley Graphs. ISBRA 2020: 406-415 - [c7]Jakob Lykke Andersen, Marc Hellmuth, Daniel Merkle, Nikolai Nøjgaard, Marco Peressotti:
A Graph-Based Tool to Embed the π-Calculus into a Computational DPO Framework. SOFSEM (Doctoral Student Research Forum) 2020: 121-132 - [i39]Marc Hellmuth, Carsten R. Seemann, Peter F. Stadler:
Generalized Fitch Graphs III: Symmetrized Fitch maps and Sets of Symmetric Binary Relations that are explained by Unrooted Edge-labeled Trees. CoRR abs/2001.05921 (2020) - [i38]Dulce I. Valdivia, Manuela Geiß, Maribel Hernández-Rosales, Peter F. Stadler, Marc Hellmuth:
Hierarchical and Modularly-Minimal Vertex Colorings. CoRR abs/2004.06340 (2020) - [i37]Tom Hartmann, Max Bannach, Martin Middendorf, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth:
Complete Edge-Colored Permutation Graphs. CoRR abs/2004.07118 (2020) - [i36]David Schaller, Manuela Geiß, Peter F. Stadler, Marc Hellmuth:
Complete Characterization of Incorrect Orthology Assignments in Best Match Graphs. CoRR abs/2006.02249 (2020) - [i35]David Schaller, Peter F. Stadler, Marc Hellmuth:
Complexity of Modification Problems for Best Match Graphs. CoRR abs/2006.16909 (2020) - [i34]David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler:
Best Match Graphs with Binary Trees. CoRR abs/2011.00511 (2020) - [i33]David Schaller, Manuel Lafond, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth:
Indirect Identification of Horizontal Gene Transfer. CoRR abs/2012.08897 (2020)
2010 – 2019
- 2019
- [j29]Marc Hellmuth:
Generalized Fitch graphs: Edge-labeled graphs that are explained by edge-labeled trees. Discret. Appl. Math. 267: 1-11 (2019) - [i32]Manuela Geiß, Marcos González, Alitzel López, Dulce I. Valdivia, Marc Hellmuth, Maribel Hernández-Rosales, Peter F. Stadler:
Best Match Graphs and Reconciliation of Gene Trees with Species Trees. CoRR abs/1904.12021 (2019) - [i31]Dulce I. Valdivia, Manuela Geiß, Marc Hellmuth, Maribel Hernández-Rosales, Peter F. Stadler:
Hierarchical Colorings of Cographs. CoRR abs/1906.10031 (2019) - [i30]Marc Hellmuth, Manuela Geiß, Peter F. Stadler:
Complexity of Modification Problems for Reciprocal Best Match Graphs. CoRR abs/1907.08865 (2019) - [i29]Manuel Lafond, Marc Hellmuth:
Reconstruction of time-consistent species trees. CoRR abs/1910.13123 (2019) - [i28]Jakob Lykke Andersen, Marc Hellmuth, Daniel Merkle, Nikolai Nøjgaard, Marco Peressotti:
A Graph-Based Tool to Embed the π-Calculus into a Computational DPO Framework. CoRR abs/1911.00407 (2019) - [i27]Marc Hellmuth, Carsten R. Seemann, Peter F. Stadler:
Generalized Fitch Relations II: Sets of Binary Relations that are explained by Edge-labeled Trees. CoRR abs/1911.07469 (2019) - 2018
- [j28]Marc Hellmuth, Yangjing Long, Manuela Geiß, Peter F. Stadler:
A short note on undirected Fitch graphs. Art Discret. Appl. Math. 1(1): #P1.08 (2018) - [j27]Nikolai Nøjgaard, Manuela Geiß, Daniel Merkle, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth:
Time-consistent reconciliation maps and forbidden time travel. Algorithms Mol. Biol. 13(1): 2:1-2:17 (2018) - [j26]Carsten R. Seemann, Marc Hellmuth:
The matroid structure of representative triple sets and triple-closure computation. Eur. J. Comb. 70: 384-407 (2018) - [j25]Marc Hellmuth, Nicolas Wieseke:
On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions. J. Comb. Optim. 36(2): 591-616 (2018) - [c6]Marc Hellmuth, Anders S. Knudsen, Michal Kotrbcík, Daniel Merkle, Nikolai Nøjgaard:
Linear Time Canonicalization and Enumeration of Non-Isomorphic 1-Face Embeddings. ALENEX 2018: 154-168 - [c5]Nikolai Nøjgaard, Nadia El-Mabrouk, Daniel Merkle, Nicolas Wieseke, Marc Hellmuth:
Partial Homology Relations - Satisfiability in Terms of Di-Cographs. COCOON 2018: 403-415 - [i26]Marc Hellmuth:
Generalized Fitch Graphs: Edge-labeled Graphs that are explained by Edge-labeled Trees. CoRR abs/1802.03657 (2018) - 2017
- [j24]Marc Hellmuth:
Biologically feasible gene trees, reconciliation maps and informative triples. Algorithms Mol. Biol. 12(1): 23:1-23:16 (2017) - [c4]Nikolai Nøjgaard, Manuela Geiß, Daniel Merkle, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth:
Forbidden Time Travel: Characterization of Time-Consistent Tree Reconciliation Maps. WABI 2017: 17:1-17:12 - [i25]Marc Hellmuth:
From event-labeled gene trees with horizontal gene transfer to species trees. CoRR abs/1701.07689 (2017) - [i24]Marc Hellmuth, Adrian Fritz, Nicolas Wieseke, Peter F. Stadler:
Merging Modules is equivalent to Editing P4's. CoRR abs/1702.07499 (2017) - [i23]Nikolai Nøjgaard, Manuela Geiß, Peter F. Stadler, Daniel Merkle, Nicolas Wieseke, Marc Hellmuth:
Forbidden Time Travel: Characterization of Time-Consistent Tree Reconciliation Maps. CoRR abs/1705.02179 (2017) - [i22]Marc Hellmuth:
A Local Prime Factor Decomposition Algorithm for Strong Product Graphs. CoRR abs/1705.03817 (2017) - [i21]Marc Hellmuth, Wilfried Imrich, Werner Klöckl, Peter F. Stadler:
Local algorithms for the prime factorization of strong product graphs. CoRR abs/1705.03823 (2017) - [i20]Maribel Hernandez-Rosales, Marc Hellmuth, Nicolas Wieseke, Katharina T. Huber, Vincent Moulton, Peter F. Stadler:
From event labeled gene trees to species trees. CoRR abs/1705.04190 (2017) - [i19]Marc Hellmuth, Lydia Ostermeier, Peter F. Stadler:
A Survey on Hypergraph Products (Erratum). CoRR abs/1705.06037 (2017) - [i18]Nikolai Nøjgaard, Nadia El-Mabrouk, Daniel Merkle, Nicolas Wieseke, Marc Hellmuth:
Partial Orthology, Paralogy and Xenology Relations - Satisfiability in terms of Di-Cographs. CoRR abs/1711.00504 (2017) - [i17]Manuela Geiß, John Anders, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth:
Reconstructing Gene Trees From Fitch's Xenology Relation. CoRR abs/1711.02152 (2017) - [i16]Manuela Geiß, Marc Hellmuth, Yangjing Long, Peter F. Stadler:
A Short Note on Undirected Fitch Graphs. CoRR abs/1712.01544 (2017) - [i15]Marc Hellmuth, Nicolas Wieseke, Marcus Lechner, Hans-Peter Lenhof, Martin Middendorf, Peter F. Stadler:
Phylogenomics with Paralogs. CoRR abs/1712.06442 (2017) - 2016
- [j23]Richard H. Hammack, Marc Hellmuth, Lydia Ostermeier, Peter F. Stadler:
Associativity and Non-Associativity of Some Hypergraph Products. Math. Comput. Sci. 10(3): 403-408 (2016) - [j22]Marc Hellmuth, Florian Lehner:
Fast factorization of Cartesian products of (directed) hypergraphs. Theor. Comput. Sci. 615: 1-11 (2016) - [i14]Marc Hellmuth, Nicolas Wieseke:
Construction of Gene and Species Trees from Sequence Data incl. Orthologs, Paralogs, and Xenologs. CoRR abs/1602.08268 (2016) - [i13]Marc Hellmuth, Peter F. Stadler, Nicolas Wieseke:
The Mathematics of Xenology: Di-cographs, Symbolic Ultrametrics, 2-structures and Tree-representable Systems of Binary Relations. CoRR abs/1603.02467 (2016) - [i12]Marc Hellmuth, Maribel Hernandez-Rosales, Yangjing Long, Peter F. Stadler:
Inference of Phylogenetic Trees from the Knowledge of Rare Evolutionary Events. CoRR abs/1612.09093 (2016) - 2015
- [j21]Marc Hellmuth, Tilen Marc, Lydia Ostermeier, Peter F. Stadler:
The relaxed square property. Australas. J Comb. 62: 240- (2015) - [j20]Marc Hellmuth, Wilfried Imrich, Tomas Kupka:
Fast recognition of partial star products and quasi cartesian products. Ars Math. Contemp. 9(2): 223-242 (2015) - [j19]Sarah Berkemer, Ricardo Régis Cavalcante Chaves, Adrian Fritz, Marc Hellmuth, Maribel Hernandez-Rosales, Peter F. Stadler:
Spiders can be Recognized by Counting Their Legs. Math. Comput. Sci. 9(4): 437-441 (2015) - [j18]Marc Hellmuth, Tilen Marc:
On the Cartesian skeleton and the factorization of the strong product of digraphs. Theor. Comput. Sci. 565: 16-29 (2015) - [c3]Marc Hellmuth, Nicolas Wieseke:
On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions. COCOON 2015: 609-623 - [i11]Marc Hellmuth, Nicolas Wieseke:
On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions. CoRR abs/1501.03931 (2015) - [i10]Marc Hellmuth, Florian Lehner:
Fast Factorization of Cartesian products of Hypergraphs. CoRR abs/1508.07181 (2015) - [i9]Marc Hellmuth, Nicolas Wieseke:
On Tree Representations of Relations and Graphs: Symbolic Ultrametrics and Cograph Edge Decompositions. CoRR abs/1509.05069 (2015) - [i8]Marc Hellmuth, Adrian Fritz, Nicolas Wieseke, Peter F. Stadler:
Techniques for the Cograph Editing Problem: Module Merge is equivalent to Editing P4s. CoRR abs/1509.06983 (2015) - 2014
- [j17]Marc Hellmuth, Josef Leydold, Peter F. Stadler:
Convex cycle bases. Ars Math. Contemp. 7(1): 123-140 (2014) - [j16]Maribel Hernandez-Rosales, Nicolas Wieseke, Marc Hellmuth, Peter F. Stadler:
Simulation of gene family histories. BMC Bioinform. 15(S-3): A8 (2014) - [j15]Marc Hellmuth, Manuel Noll, Lydia Ostermeier:
Strong products of hypergraphs: Unique prime factorization theorems and algorithms. Discret. Appl. Math. 171: 60-71 (2014) - [j14]Marc Hellmuth, Lydia Ostermeier, Peter F. Stadler:
Unique square property, equitable partitions, and product-like graphs. Discret. Math. 320: 92-103 (2014) - [i7]Marc Hellmuth, Tilen Marc:
On the Cartesian Skeleton and the Factorization of the Strong Product of Digraphs. CoRR abs/1401.4965 (2014) - [i6]Marc Hellmuth, Tilen Marc, Lydia Ostermeier, Peter F. Stadler:
The Relaxed Square Property. CoRR abs/1407.3164 (2014) - [i5]Sarah Berkemer, Ricardo Régis Cavalcante Chaves, Adrian Fritz, Marc Hellmuth, Maribel Hernandez-Rosales, Peter F. Stadler:
Spiders can be recognized by counting their legs. CoRR abs/1411.2105 (2014) - 2013
- [j13]Marc Hellmuth:
On the complexity of recognizing S-composite and S-prime graphs. Discret. Appl. Math. 161(7-8): 1006-1013 (2013) - [j12]Marc Hellmuth, Wilfried Imrich, Tomas Kupka:
Partial Star Products: A Local Covering Approach for the Recognition of Approximate Cartesian Product Graphs. Math. Comput. Sci. 7(3): 255-273 (2013) - [i4]Marc Hellmuth, Lydia Ostermeier, Peter F. Stadler:
Square Property, Equitable Partitions, and Product-like Graphs. CoRR abs/1301.6898 (2013) - [i3]Marc Hellmuth, Wilfried Imrich, Tomas Kupka:
Partial Star Products: A Local Covering Approach for the Recognition of Approximate Cartesian Product Graphs. CoRR abs/1303.6803 (2013) - [i2]Marc Hellmuth, Manuel Noll, Lydia Ostermeier:
Strong Products of Hypergraphs: Unique Prime Factorization Theorems and Algorithms. CoRR abs/1305.1824 (2013) - [i1]Marc Hellmuth, Wilfried Imrich, Tomas Kupka:
Fast Recognition of Partial Star Products and Quasi Cartesian Products. CoRR abs/1308.2101 (2013) - 2012
- [j11]Marc Hellmuth, Philipp-Jens Ostermeier, Peter F. Stadler:
Minimum cycle bases of lexicographic products. Ars Math. Contemp. 5(2): 223-234 (2012) - [j10]Maribel Hernandez-Rosales, Marc Hellmuth, Nicolas Wieseke, Katharina T. Huber, Vincent Moulton, Peter F. Stadler:
From event-labeled gene trees to species trees. BMC Bioinform. 13(S-19): S6 (2012) - [j9]Marc Hellmuth, Lydia Ostermeier, Peter F. Stadler:
Diagonalized Cartesian products of s-prime graphs are s-prime. Discret. Math. 312(1): 74-80 (2012) - [j8]Lydia Ostermeier, Marc Hellmuth, Peter F. Stadler:
The Cartesian product of hypergraphs. J. Graph Theory 70(2): 180-196 (2012) - [j7]Marc Hellmuth, Lydia Ostermeier, Peter F. Stadler:
A Survey on Hypergraph Products. Math. Comput. Sci. 6(1): 1-32 (2012) - 2011
- [j6]Marc Hellmuth:
A local prime factor decomposition algorithm. Discret. Math. 311(12): 944-965 (2011) - 2010
- [j5]Stefan Jänicke, Christian Heine, Marc Hellmuth, Peter F. Stadler, Gerik Scheuermann:
Visualization of Graph Products. IEEE Trans. Vis. Comput. Graph. 16(6): 1082-1089 (2010)
2000 – 2009
- 2009
- [j4]Philipp-Jens Ostermeier, Marc Hellmuth, Josef Leydold, Konstantin Klemm, Peter F. Stadler:
A note on quasi-robust cycle bases. Ars Math. Contemp. 2(2): 231-240 (2009) - [j3]Marc Hellmuth, Wilfried Imrich, Werner Klöckl, Peter F. Stadler:
Approximate graph products. Eur. J. Comb. 30(5): 1119-1133 (2009) - [j2]Marc Hellmuth, Daniel Merkle, Martin Middendorf:
Extended shapes for the combinatorial design of RNA sequences. Int. J. Comput. Biol. Drug Des. 2(4): 371-384 (2009) - [j1]Marc Hellmuth, Wilfried Imrich, Werner Klöckl, Peter F. Stadler:
Local Algorithms for the Prime Factorization of Strong Product Graphs. Math. Comput. Sci. 2(4): 653-682 (2009) - [c2]Todd Ingalls, Georg Martius, Manja Marz, Sonja J. Proshaka, Marc Hellmuth:
Converting DNA to Music: ComposAlign. GCB 2009: 93-103 - [c1]Marc Hellmuth, Daniel Merkle, Martin Middendorf:
On the Design of RNA Sequences for Realizing Extended Shapes. IJCBS 2009: 167-173
Coauthor Index
Maribel Hernandez-Rosales
aka: Maribel Hernández-Rosales
aka: Maribel Hernández-Rosales
Nikolai Nøjgaard
aka: Nikolai N. Nøjgaard
aka: Nikolai N. Nøjgaard
[j50] [j49] [i55] [j48] [j46] [j45] [j44] [j42] [i54] [i52] [j41] [j40] [j39] [j38] [j36] [j35] [c10] [c9] [i51] [i50] [i49] [i48] [i47] [i46] [i45] [i42] [i41] [j34] [j33] [j31] [j30] [i39] [i38] [i37] [i36] [i35] [i34] [i33] [i32] [i31] [i30] [i27] [j28] [j27] [c4] [i24] [i23] [i21] [i20] [i19] [i17] [i16] [i15] [j23] [i13] [i12] [j21] [j19] [i8] [j17] [j16] [j14] [i6] [i5] [i4] [j11] [j10] [j9] [j8] [j7] [j5] [j4] [j3] [j1]