The tree-child network inference problem for line trees and the shortest common supersequence problem for permutation strings

DOI10.1016/j.jcss.2024.103546MaRDI QIDQ6564619

Louxin Zhang, Laurent Bulteau

Publication date: 1 July 2024

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

tree-child networksshortest common supersequenceline trees

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Computing the minimum number of hybridization events for a consistent evolutionary history
• A lower bound on the length of a sequence containing all permutations as subsequences
• Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies
• A universal tree-based network with the minimum number of reticulations
• A construction of short sequences containing all permutations of a set as subsequences
• A practical fixed-parameter algorithm for constructing tree-child networks from multiple binary trees
• Counting and enumerating tree-child networks and their subclasses
• Phylogeny

This page was built for publication: The tree-child network inference problem for line trees and the shortest common supersequence problem for permutation strings