Building PQR trees in almost-linear time

DOI10.1016/j.endm.2005.05.006zbMath1136.68370OpenAlexW2023165871MaRDI QIDQ3439658

Guilherme P. Telles, João Meidanis

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2005.05.006

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Protein sequences, DNA sequences (92D20) Genetics and epigenetics (92D10) Data structures (68P05)

Related Items (1)

On the Generalised Character Compatibility Problem for Non-branching Character Trees

This page was built for publication: Building PQR trees in almost-linear time