Showing results 1 to 20 of 59
next >
| Title | Author(s) | Issue Date | |
|---|---|---|---|
Whole-genome sequencing identifies recurrent mutations in hepatocellular carcinoma Journal:Genome Research | 2013 | ||
Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison Proceeding/Conference:Proceedings of the 11th Annual International Symposium on Algorithms and Computation, Lecture Notes in Computer Science | 2000 | ||
Transluency of biaxial flexural strength of four ceramic core materials Journal:Dental Materials | 2008 | ||
Structural alignment of RNA with complex pseudoknot structure Journal:Journal of Computational Biology | 2011 | ||
Structural alignment of RNA with complex pseudoknot structure Journal:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2009 | ||
Space efficient indexes for string matching with don't cares Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2007 | ||
A space and time efficient algorithm for constructing compressed suffix arrays Journal:Algorithmica (New York) | 2007 | ||
A space adn time efficient algorithm for constructing compressed suffix arragys Proceeding/Conference:Proceedings of the 8th Annual International Computing and Combinatorics Conference | 2002 | ||
| 2017 | |||
Reconstructing k-Reticulated Phylogenetic Network from a Set of Gene Trees Proceeding/Conference:Lecture Notes in Computer Science | 2013 | ||
Predicting RNA Secondary Structures with Arbitrary Pseudoknots by Maximizing the Number of Stacking Pairs Journal:Journal of Computational Biology | 2003 | ||
Practical aspects of compressed suffix arrays and FM-index in searching DNA sequences Proceeding/Conference:Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithms and Combinatorics | 2004 | ||
The point placement problem on a line improved bounds for pairwise distance queries Proceeding/Conference:Lecture Notes in Computer Science | 2007 | ||
Pervasive Multimedia Markup Language (PMML): an XML-based Multimedia Content Specification for Pervasive Access Proceeding/Conference:International Conference on World Wide Web, WWW'01 | 2001 | ||
Non-shared edges and nearest neighbor interchanges revisited Journal:Information Processing Letters | 2004 | ||
Non-overlapping common substrings allowing mutations Journal:Mathematics in Computer Science | 2008 | ||
NanoPort: A web portal for nanoscale science and technology Proceeding/Conference:Proceedings of the ACM International Conference on Digital Libraries | 2002 | ||
A mutation-sensitive approach for locating conserved gene pairs between related species Proceeding/Conference:Proceedings - Fourth IEEE Symposium on Bioinformatics and Bioengineering, BIBE 2004 | 2004 | ||
The mutated subsequence problem and locating conserved genes Journal:Bioinformatics | 2005 | ||
| 2008 |