Skip to main content

6 Result(s)

within Siu Ming Yiu Remove this filter Theory of Computation Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    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 base pairs, many biological research has been centered on analyzing this sequence. Theoretically speaking, it is now feasible to acco...

    Tak-Wah Lam, Kunihiko Sadakane, Wing-Kin Sung, Siu-Ming Yiu in Computing and Combinatorics (2002)

  2. No Access

    Chapter and Conference Paper

    Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix

    Given a distance matrix M that specifies the pairwise evolutionary distances between n species, the phylogenetic tree reconstruction problem asks for an edge-weighted phylogenetic tree that satisfies M, if one ex...

    Ho-Leung Chan, Jesper Jansson, Tak-Wah Lam… in Mathematical Foundations of Computer Scien… (2005)

  3. No Access

    Chapter and Conference Paper

    Space Efficient Indexes for String Matching with Don’t Cares

    Given a text T of length n, the classical indexing problem for pattern matching is to build an index for T so that for any query pattern P, we can report efficiently all occurrences of P in T. Cole et al (2004) e...

    Tak-Wah Lam, Wing-Kin Sung, Siu-Lung Tam, Siu-Ming Yiu in Algorithms and Computation (2007)

  4. 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)

  5. 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)

  6. No Access

    Chapter and Conference Paper

    Outsourced Privacy-Preserving Reduced SVM Among Multiple Institutions

    Executing data mining algorithms locally is usually computationally intensive. A promising solution is to outsource the heavy data mining tasks and datasets. On the other hand, combining data from multiple ins...

    Jun Zhang, Siu Ming Yiu, Zoe L. Jiang in Algorithms and Architectures for Parallel … (2020)