3 papers
math.CO2025
On the size of the neighborhoods of a word
Cedric Chauve, Louxin Zhang
The d-neighborhood of a word W in the Levenshtein distance is the set of all words at distance at most d from W. Generating the neighborhood of a word W, or related sets of words s…
q-bio.PE2024
Bounding the number of reticulation events for displaying multiple trees in a phylogenetic network
Yufeng Wu, Louxin Zhang
Reconstructing a parsimonious phylogenetic network that displays multiple phylogenetic trees is an important problem in theory of phylogenetics, where the complexity of the inferre…
q-bio.PE2024
A Vector Representation for Phylogenetic Trees
Cedric Chauve, Caroline Colijn, Louxin Zhang
Good representations for phylogenetic trees and networks are important for optimizing storage efficiency and implementation of scalable methods for the inference and analysis of ev…