Showing results 25 to 44 of 59
< previous
next >
Title | Author(s) | Issue Date | |
---|---|---|---|
Indexing similar DNA sequences Proceeding/Conference:Lecture Notes in Computer Science | 2010 | ||
Improving the Efficiency and Accuracy of aligning Erroneous mRNAS Journal:W S E A S Transactions on Systems | 2004 | ||
Improved approximate string matching using compressed suffix data structures Journal:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2005 | ||
Improved approximate string matching using compressed suffix data structures Proceeding/Conference:Algorithmica (New York) | 2008 | ||
2022 | |||
2014 | |||
Genome-wide survey of recurrent HBV integration in hepatocellular carcinoma Journal:Nature Genetics | 2012 | ||
A Faster and Unifying algorithm for Comparing Trees Proceeding/Conference:Proceedings of the 11th Annual Symposium on Combinatiorial Pattern Matching | 2000 | ||
An experimental study of compressed indexing and local alignments of DNA Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2007 | ||
An even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings Journal:Journal of Algorithms | 2001 | ||
Evaluating Students' Perception of a Three-Dimensional Virtual World Learning Environment Journal:Knowledge Management & E-Learning: An International Journal | 2013 | ||
Detection of generic spaced motifs using submotif pattern mining Journal:Bioinformatics | 2007 | ||
Design and evaluation of a Facebook game for self-directed e-learning Journal:Knowledge Management & E-Learning: An International Journal | 2016 | ||
Default-sensitive preprocessings for finding maxima Proceeding/Conference:Computing Theory '98: Proceedings of the 4th Australasian Theory Symposium - CATS'98 Perth, 2-3 February 1998 | 1999 | ||
A Decomposition Theorem For Maximum Weight Bipartite Matchings with Applications To Evolutionary Trees Proceeding/Conference:Proceedings of the European Symposium on Algorithms | 1999 | ||
A decomposition theorem for maximum weight bipartite matchings Journal:SIAM Journal on Computing | 2001 | ||
2014 | |||
Construction of online catalog topologies using decision trees Proceeding/Conference:International Workshop on Advance Issues of E-Commerce and Web-Based Information Systems Proceedings | 2000 | ||
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 | ||
Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time Journal:Nordic Journal of Computing | 1996 |