Showing results 1 to 20 of 257
next >
| Title | Author(s) | Issue Date | |
|---|---|---|---|
A 5-competitive on-line scheduler for merging video streams Proceeding/Conference:Proceedings of 15th International Parallel and Distributed Processing Symposium | 2001 | ||
A multi-task convolutional deep neural network for variant calling in single molecule sequencing Journal:Nature Communications | 2019 | ||
A simple and economical method for improving whole genome alignment Journal:BMC Genomics | 2017 | ||
A simple and economical method for improving whole genome alignment Proceeding/Conference:IEEE International Conference on Computational Advances in Bio and Medical Sciences Proceedings | 2015 | ||
AC-DIAMOND v1: Accelerating large-scale DNA-protein alignment. Journal:Bioinformatics | 2018 | ||
AC-DIAMOND: accelerating protein alignment via better SIMD parallelization and space-efficient indexing Proceeding/Conference:Lecture Notes in Computer Science | 2016 | ||
Accurate annotation of metagenomic data without species-level reference Journal:International Journal of Data Mining and Bioinformatics | 2017 | ||
| 2010 | |||
Aggressive online deadline scheduling Journal:Electronic Notes in Theoretical Computer Science | 2004 | ||
All-cavity maximum Matchings Proceeding/Conference:International Symposium on Algorithms And Computation | 1997 | ||
Allowing Mismatches In Anchors For Whole Genome Alignment Journal:W S E A S Transactions on Biology and Biomedicine | 2007 | ||
Allowing mismatches in anchors for wholw genome alignment: Generation and effectiveness Proceeding/Conference:Series on Advances In Bioinformatics and Computational Biology | 2005 | ||
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 | ||
Approximate string matching using compressed suffix arrays Journal:Theoretical Computer Science | 2006 | ||
Approximating biconnectivity in parallel Proceeding/Conference:Annual ACM Symposium on Parallel Algorithms and Architectures | 1995 | ||
Approximating biconnectivity in parallel Journal:Algorithmica (New York) | 1998 | ||
Approximating frequent items in asynchronous data stream over a sliding window Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2009 | ||
| 2011 | |||
Approximating the nearest neighbor interchange distance for evolutionary trees with non-uniform degrees Proceeding/Conference:Proceedings of the Fifth Annual International Computing and Combinatorics Conference (COCOON'99) | 1999 | ||
Approximating the Nearest Neighbor Interchange Distance for Non-Uniform-Degree Evolutionary Trees Journal:International Journal of Foundations of Computer Science | 2001 |