Image de couverture de livre

Visualizing Geophylogenies -- Internal and External Labeling with Phylogenetic Tree Constraints

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Klawitter, Jonathan, Klesen, Felix, Scholl, Joris Y., van Dijk, Thomas C., Zaft, Alexander
Format:	Preprint
Publié:	2023
Sujets:	Discrete Mathematics Computational Complexity Combinatorics 68R10, 92D15
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Recovery of cyclic words by their subwords
par: Luchinin, Sergey, et autres
Publié: (2024)

Palindromic length of infinite aperiodic words
par: Rukavicka, Josef
Publié: (2024)

Subexponential upper bound on the number of rich words
par: Rukavicka, Josef
Publié: (2025)

String attractors and bi-infinite words
par: Béaur, Pierre, et autres
Publié: (2024)

Additive word complexity and Walnut
par: Popoli, Pierre, et autres
Publié: (2024)

On the pseudorandomness of Parry--Bertrand automatic sequences
par: Popoli, Pierre, et autres
Publié: (2024)

Factor-balancedness, linear recurrence, and factor complexity
par: Espinoza, Bastiàn, et autres
Publié: (2026)

Avoiding abelian and additive powers in rich words
par: Andrade, Jonathan, et autres
Publié: (2024)

Extremal Results on Conflict-free Coloring
par: Bhyravarapu, Sriram, et autres
Publié: (2023)

Orthogonal Latin Squares of Order Ten with Two Relations: A SAT Investigation
par: Bright, Curtis, et autres
Publié: (2025)

Universal partial tori
par: Carey, William D., et autres
Publié: (2024)

WELLDOC property for words generated by morphisms
par: Puzynina, Svetlana, et autres
Publié: (2026)

Myrvold's Results on Orthogonal Triples of $10 \times 10$ Latin Squares: A SAT Investigation
par: Bright, Curtis, et autres
Publié: (2025)

Exploring the Crochemore and Ziv-Lempel factorizations of some automatic sequences with the software Walnut
par: Jahannia, Marieh, et autres
Publié: (2024)

Towards Characterization of 5-List-Colorability of Toroidal Graphs
par: Dvořák, Zdeněk, et autres
Publié: (2024)

The repetition threshold for ternary rich words
par: Currie, James D., et autres
Publié: (2024)

Digital Convexity and Combinatorics on Words
par: De Luca, Alessandro, et autres
Publié: (2025)

From Historical Puzzles to Grammatical Constraints: Circular Partitions, Generalized Run-Length Encodings, and Polynomial-Time Decidability
par: Khormali, Omid, et autres
Publié: (2026)

Word-Representability of Graphs with respect to Split Recomposition
par: Dwary, Tithi, et autres
Publié: (2024)

On solving basic equations over the semiring of functional digraphs
par: Dennunzio, Alberto, et autres
Publié: (2024)

On the Complexity of Distance-$d$ Independent Set Reconfiguration
par: Hoang, Duc A.
Publié: (2022)

Obstructions to return preservation for episturmian morphisms
par: Berthé, Valérie, et autres
Publié: (2024)

A simple algorithm for checking equivalence of counting functions on free monoids
par: Kiyashko, Petr, et autres
Publié: (2024)

Harmonious Colorings: bounds, heuristics and integer-linear formulations
par: Araújo, Júlio, et autres
Publié: (2026)

Note on Min-k-Planar Drawings of Graphs
par: Hliněný, Petr, et autres
Publié: (2024)

Stack and Queue Numbers of Graphs Revisited
par: Hliněný, Petr, et autres
Publié: (2023)

Hereditary Graph Product Structure and $\cal H$-clique-width
par: Hliněný, Petr, et autres
Publié: (2024)

Polygonal corona limit on multigrid dual tilings
par: Lutfalla, Victor, et autres
Publié: (2024)

Grid-drawings of graphs in three-dimensions
par: Balogh, Jozsef, et autres
Publié: (2024)

Complexity of chess domination problems
par: Langlois-Rémillard, Alexis, et autres
Publié: (2022)

Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
par: Furmańczyk, Hanna, et autres
Publié: (2020)

Relative position in binary substitutions
par: Coons, Michael, et autres
Publié: (2024)

Structure and growth of $\mathbb{R}$-bonacci words
par: Dovgal, Sergey, et autres
Publié: (2023)

Skip Letters for Short Supersequence of All Permutations
par: Tan, Oliver
Publié: (2022)

Three-edge-coloring projective planar cubic graphs: A generalization of the Four Color Theorem
par: Inoue, Yuta, et autres
Publié: (2024)

Complexity of learning matchings and half graphs via edge queries
par: Mande, Nikhil S., et autres
Publié: (2025)

The Equivalence Problem of E-Pattern Languages with Regular Constraints is Undecidable
par: Nowotka, Dirk, et autres
Publié: (2024)

The Equivalence Problem of E-Pattern Languages with Length Constraints is Undecidable
par: Nowotka, Dirk, et autres
Publié: (2024)

Toward P vs NP: An Observer-Theoretic Separation via SPDP Rank and a ZFC-Equivalent Foundation within the N-Frame Model
par: Edwards, Darren J.
Publié: (2025)

An Analysis of Decision Problems for Relational Pattern Languages under Various Constraints
par: Jansen, Klaus, et autres
Publié: (2025)