Results 21 to 25 of 25
< Previous  Page 2 of 2
TypeTitleAuthor(s)YearViews
Approximate string matching using compressed suffix arrays
Journal:
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher:
Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
Huynh, TND; Hon, WK; Lam, TW; Sung, WK2004207
 
Constructing compressed suffix arrays with large alphabets
Journal:
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher:
Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
Hon, WK; Lam, TW; Sadakane, K; Sung, WK2003213
 
Approximating the Nearest Neighbor Interchange Distance for Non-Uniform-Degree Evolutionary Trees
Journal:
International Journal of Foundations of Computer Science
Publisher:
World Scientific Publishing Co Pte Ltd. The Journal's web site is located at http://www.worldscinet.com/ijfcs/ijfcs.shtml
Hon, WK; Lam, TW2001178
 
Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers
Proceedings/Conference:
Proceedings of the 11th Annual International Symposium on Algorithms and Computation, Lecture Notes in Computer Science
Publisher:
Springer.
Hon, WK; Kao, MY; Lam, TW2000120
 
Approximating the nearest neighbor interchange distance for evolutionary trees with non-uniform degrees
Proceedings/Conference:
Proceedings of the Fifth Annual International Computing and Combinatorics Conference (COCOON'99)
Hon, WK; Lam, TW199999
 
< Previous  Page 2 of 2
Export Records
Step 1: Select content and export format
  • Citation only
Step 2: Select export method
  • Download