Showing results 1 to 20 of 147
next >
| Title | Author(s) | Issue Date | |
|---|---|---|---|
1-bounded space algorithms for 2-dimensional bin packing Proceeding/Conference:Lecture Notes in Computer Science | 2009 | ||
1-space bounded algorithms for 2-dimensional bin packing Proceeding/Conference:2nd Asian Association for Algorithms and Computation Meeting, AAAC 2009 | 2009 | ||
A 5-competitive on-line scheduler for merging video streams Proceeding/Conference:Proceedings of 15th International Parallel and Distributed Processing Symposium | 2001 | ||
A data-centric pipeline using convolutional neural network to select better multiple sequence alignment method Proceeding/Conference:Proceedings of the 11th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics (BCB '20) | 2020 | ||
A simple algorithm for finding all k-edge-connected components Journal:PLoS ONE | 2015 | ||
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 | ||
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 | ||
ALMOST LINEAR TIME AND O(N LOG N plus E) MESSAGES DISTRIBUTED ALGORITHM FOR MINIMUM-WEIGHT SPANNING TREES. Proceeding/Conference:Annual Symposium on Foundations of Computer Science (Proceedings) | 1985 | ||
Analyzing the Error Rates of Bitcoin Clustering Heuristics Proceeding/Conference:The Eighteenth IFIP WG 11.9 International Conference on Digital Forensics, Virtual, 2022 | 2022 | ||
Approximated distributed minimum vertex cover algorithms for bounded degree graphs Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2010 | ||
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 | |||
An approximation algorithm for bounded length tree linear broadcast routing Proceeding/Conference:International Computer Symposium | 1996 | ||
Approximation algorithms for the partial assignment problem Journal:Theoretical Computer Science | 2020 |