Showing results 1 to 20 of 71
next >
| Title | Author(s) | Issue Date | Views | |
|---|---|---|---|---|
| 2019 | 165 | |||
AC-DIAMOND v1: Accelerating large-scale DNA-protein alignment. Journal:Bioinformatics | 2018 | 71 | ||
AC-DIAMOND: accelerating protein alignment via better SIMD parallelization and space-efficient indexing Proceeding/Conference:Lecture Notes in Computer Science | 2016 | 108 | ||
Adaptive phenotype testing for AND/OR items Proceeding/Conference:Lecture Notes In Computer Science | 2011 | 117 | ||
Algorithms for challenging motif problems Journal:Journal of Bioinformatics and Computational Biology | 2006 | |||
Assembling short reads with much less memory Proceeding/Conference:International Meeting on Human Genome Variation & Complex Genome Analysis, HGV 2009 | 2009 | |||
Clustering-based approach for predicting motif pairs from protein interaction data Journal:Journal of Bioinformatics and Computational Biology | 2009 | 107 | ||
| 2020 | 46 | |||
| 2022 | 2 | |||
Deterministic Polynomial-Time Algorithms for Designing Short DNA Words Journal:Theoretical Computer Science | 2013 | 41 | ||
Deterministic polynomial-time algorithms for designing short DNA words Proceeding/Conference:Lecture Notes in Computer Science | 2010 | 106 | ||
Discovering DNA motifs with nucleotide dependency Proceeding/Conference:Proceedings - Sixth IEEE Symposium on BioInformatics and BioEngineering, BIBE 2006 | 2006 | 105 | ||
Discovering Motifs with Transcription Factor Domain Knowledge Proceeding/Conference:Pacific Symposium on Biocomputing (PSB 2007) | 2007 | |||
Discovering motifs with transcription factor domain knowledge. Journal:Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing | 2007 | |||
DMPFinder - Finding differentiating pathways with gaps from two groups of metabolic networks Proceeding/Conference:International Conference on Bioinformatics and Computational Biology | 2011 | 70 | ||
DNA motif representation with nucleotide dependency Journal:IEEE/ACM Transactions on Computational Biology and Bioinformatics | 2008 | |||
| 2022 | ||||
An efficient algorithm for string motif discovery Proceeding/Conference:Series on Advances in Bioinformatics and Computational Biology | 2006 | 117 | ||
An efficient algorithm for the extended (l,d)-motif problem with unknown number of binding sites Proceeding/Conference:Proceedings - BIBE 2005: 5th IEEE Symposium on Bioinformatics and Bioengineering | 2005 | 102 | ||
An efficient motif discovery algorithm with unknown motif length and number of binding sites. Journal:International journal of data mining and bioinformatics | 2006 |