Skip to main content

and
  1. No Access

    Article

    Faster Algorithms for Computing the R* Consensus Tree

    The fastest known algorithms for computing the R* consensus tree of k rooted phylogenetic trees with n leaves each and identical leaf label sets run in ...

    Jesper Jansson, Wing-Kin Sung, Hoa Vu, Siu-Ming Yiu in Algorithmica (2016)

  2. No Access

    Article

    A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays

    With the first human DNA being decoded into a sequence of about 2.8 billion characters, much biological research has been centered on analyzing this sequence. Theoretically speaking, it is now feasible to acco...

    Wing-Kai Hon, Tak-Wah Lam, Kunihiko Sadakane, Wing-Kin Sung, Siu-Ming Yiu in Algorithmica (2007)