Browsing by Author Sung, WK

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Showing results 1 to 20 of 57  next >
TitleAuthor(s)Issue DateViews
 
2010
416
 
All-cavity maximum Matchings
Proceeding/Conference:International Symposium on Algorithms And Computation
1997
151
 
Allowing Mismatches In Anchors For Whole Genome Alignment
Journal:W S E A S Transactions on Biology and Biomedicine
2007
296
 
Allowing mismatches in anchors for wholw genome alignment: Generation and effectiveness
Proceeding/Conference:Proceedings of 3rd Asia-Pacific Bioinformatics Conference (APBC)
2005
169
Allowing mismatches in anchors forwhole genome alignment: Generation and effectiveness
Proceeding/Conference:Series on Advances in Bioinformatics and Computational Biology
2005
144
 
2006
187
 
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)
2004
245
 
Automatic construction of online catalog topologies
Journal:IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews
2002
507
 
Automatic Construction of Online Catalog Topologies Using Decision Trees
Proceeding/Conference:2nd International Conference on Electronic Commerce and Web Technologies (EC-Web 2001)
2001
158
 
2000
402
Comparison of two approaches to building a vertical search tool: A case study in the nanotechnology domain
Proceeding/Conference:Proceedings of the ACM International Conference on Digital Libraries
2002
105
Compressed index for dynamic text
Proceeding/Conference:Data Compression Conference Proceedings
2004
160
 
2010
289
 
Compressed indexes for approximate string matching
Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2006
243
 
2008
354
 
1996
145
 
Computing the unrooted maximum agreement subtree in sub-quadratic time
Proceeding/Conference:Proceedings of the 5th Scandinavian Workshop on Algorithm and Theory, Singapore
1996
145
 
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)
2003
267
 
2000
353
 
2014
73