Memoization on shared subtrees accelerates computations on genealogical forests

DOI10.4230/LIPICS.WABI.2024.5MaRDI QIDQ6857992zbMATH OpenFDO

Authors Lukas Hübner, Alexandros Stamatakis

Publication date 13 February 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.WABI.2024.5

zbMATH Keywords

algorithmsbioinformaticspopulation genetics

Mathematics Subject Classification ID

Computational methods for problems pertaining to biology (92-08) Problems related to evolution (92D15) Protein sequences, DNA sequences (92D20)

Cites work

• Automata, Languages and Programming
• Mathematical model for studying genetic variation in terms of restriction endonucleases.
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Properties of a neutral allele model with intragenic recombination
• Random access to grammar-compressed strings
• The distribution of gene ratios for rare mutations.
• Tree compression with top trees
• Variations on the Common Subexpression Problem
• XML compression techniques: A survey and comparison

This page was built for publication: Memoization on shared subtrees accelerates computations on genealogical forests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6857992)