Showing results 7 to 26 of 71
< previous
next >
| Title | Author(s) | Issue Date | Views | |
|---|---|---|---|---|
Clustering-based approach for predicting motif pairs from protein interaction data Journal:Journal of Bioinformatics and Computational Biology | 2009 | 102 | ||
| 2020 | 46 | |||
| 2022 | 2 | |||
Deterministic Polynomial-Time Algorithms for Designing Short DNA Words Journal:Theoretical Computer Science | 2013 | 37 | ||
Deterministic polynomial-time algorithms for designing short DNA words Proceeding/Conference:Lecture Notes in Computer Science | 2010 | 99 | ||
Discovering DNA motifs with nucleotide dependency Proceeding/Conference:Proceedings - Sixth IEEE Symposium on BioInformatics and BioEngineering, BIBE 2006 | 2006 | 99 | ||
Discovering Motifs with Transcription Factor Domain Knowledge Proceeding/Conference:Pacific Symposium on Biocomputing (PSB 2007) | 2007 | 102 | ||
Discovering motifs with transcription factor domain knowledge. Journal:Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing | 2007 | 108 | ||
DMPFinder - Finding differentiating pathways with gaps from two groups of metabolic networks Proceeding/Conference:International Conference on Bioinformatics and Computational Biology | 2011 | 134 | ||
DNA motif representation with nucleotide dependency Journal:IEEE/ACM Transactions on Computational Biology and Bioinformatics | 2008 | 119 | ||
| 2022 | ||||
An efficient algorithm for string motif discovery Proceeding/Conference:Series on Advances in Bioinformatics and Computational Biology | 2006 | 111 | ||
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 | 99 | ||
An efficient motif discovery algorithm with unknown motif length and number of binding sites. Journal:International journal of data mining and bioinformatics | 2006 | 107 | ||
Exploring the limit of using a deep neural network on pileup data for germline variant calling Journal:Nature Machine Intelligence | 2020 | 90 | ||
Finding exact optimal motifs in matrix representation by partitioning Journal:Bioinformatics | 2005 | 177 | ||
Finding Linear Motif Pair from Protein Interaction Networks: A Probabilistic Approach Proceeding/Conference:The 6th Annual International Conference on Computational Systems Bioinformatics Conference (CSB 2007) | 2007 | 77 | ||
Finding linear motif pairs from protein interaction networks: a probabilistic approach. Proceeding/Conference:Computational Systems Bioinformatics Conference Proceedings | 2007 | 99 | ||
Finding motifs for insufficient number of sequences with strong binding to transcription factor Proceeding/Conference:RECOMB 2004 - Proceedings of the Eighth Annual International Conference on Research in Computational Molecular Biology | 2004 | 84 | ||
Finding motifs from all sequences with and without binding sites Journal:Bioinformatics | 2006 | 198 |