These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

202 related articles for article (PubMed ID: 21034426)

  • 1. Efficient motif finding algorithms for large-alphabet inputs.
    Kuksa PP; Pavlovic V
    BMC Bioinformatics; 2010 Oct; 11 Suppl 8(Suppl 8):S1. PubMed ID: 21034426
    [TBL] [Abstract][Full Text] [Related]  

  • 2. An Efficient Exact Algorithm for the Motif Stem Search Problem over Large Alphabets.
    Yu Q; Huo H; Vitter JS; Huan J; Nekrich Y
    IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(2):384-97. PubMed ID: 26357225
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Efficient sequential and parallel algorithms for finding edit distance based motifs.
    Pal S; Xiao P; Rajasekaran S
    BMC Genomics; 2016 Aug; 17 Suppl 4(Suppl 4):465. PubMed ID: 27557423
    [TBL] [Abstract][Full Text] [Related]  

  • 4. EMS3: An Improved Algorithm for Finding Edit-Distance Based Motifs.
    Xiao P; Cai X; Rajasekaran S
    IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(1):27-37. PubMed ID: 32931433
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Fast exact algorithms for the closest string and substring problems with application to the planted (L, d)-motif model.
    Chen ZZ; Wang L
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1400-10. PubMed ID: 21282867
    [TBL] [Abstract][Full Text] [Related]  

  • 6. An improved heuristic algorithm for finding motif signals in DNA sequences.
    Huang CW; Lee WS; Hsieh SY
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(4):959-75. PubMed ID: 20855921
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Improved Exact Enumerative Algorithms for the Planted (l, d)-Motif Search Problem.
    Tanaka S
    IEEE/ACM Trans Comput Biol Bioinform; 2014; 11(2):361-74. PubMed ID: 26355783
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Fast and practical algorithms for planted (l, d) motif search.
    Davila J; Balla S; Rajasekaran S
    IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(4):544-52. PubMed ID: 17975266
    [TBL] [Abstract][Full Text] [Related]  

  • 9. PairMotif: A new pattern-driven algorithm for planted (l, d) DNA motif search.
    Yu Q; Huo H; Zhang Y; Guo H
    PLoS One; 2012; 7(10):e48442. PubMed ID: 23119020
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Discovering Motifs in Biological Sequences Using the Micron Automata Processor.
    Roy I; Aluru S
    IEEE/ACM Trans Comput Biol Bioinform; 2016; 13(1):99-111. PubMed ID: 26886735
    [TBL] [Abstract][Full Text] [Related]  

  • 11. EMD: an ensemble algorithm for discovering regulatory motifs in DNA sequences.
    Hu J; Yang YD; Kihara D
    BMC Bioinformatics; 2006 Jul; 7():342. PubMed ID: 16839417
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Efficient sequential and parallel algorithms for planted motif search.
    Nicolae M; Rajasekaran S
    BMC Bioinformatics; 2014 Jan; 15():34. PubMed ID: 24479443
    [TBL] [Abstract][Full Text] [Related]  

  • 13. qPMS7: a fast algorithm for finding (ℓ, d)-motifs in DNA and protein sequences.
    Dinh H; Rajasekaran S; Davila J
    PLoS One; 2012; 7(7):e41425. PubMed ID: 22848493
    [TBL] [Abstract][Full Text] [Related]  

  • 14. An Efficient Exact Algorithm for Planted Motif Search on Large DNA Sequence Datasets.
    Yu Q; Hu Y; Hu X; Lan J; Guo Y
    IEEE/ACM Trans Comput Biol Bioinform; 2024; 21(5):1542-1551. PubMed ID: 38801693
    [TBL] [Abstract][Full Text] [Related]  

  • 15. A novel Bayesian DNA motif comparison method for clustering and retrieval.
    Habib N; Kaplan T; Margalit H; Friedman N
    PLoS Comput Biol; 2008 Feb; 4(2):e1000010. PubMed ID: 18463706
    [TBL] [Abstract][Full Text] [Related]  

  • 16. MUSA: a parameter free algorithm for the identification of biologically significant motifs.
    Mendes ND; Casimiro AC; Santos PM; Sá-Correia I; Oliveira AL; Freitas AT
    Bioinformatics; 2006 Dec; 22(24):2996-3002. PubMed ID: 17068086
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Efficient algorithms for biological stems search.
    Mi T; Rajasekaran S
    BMC Bioinformatics; 2013 May; 14():161. PubMed ID: 23679045
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Discovering sequence motifs.
    Bailey TL
    Methods Mol Biol; 2008; 452():231-51. PubMed ID: 18566768
    [TBL] [Abstract][Full Text] [Related]  

  • 19. On counting position weight matrix matches in a sequence, with application to discriminative motif finding.
    Sinha S
    Bioinformatics; 2006 Jul; 22(14):e454-63. PubMed ID: 16873507
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Improved benchmarks for computational motif discovery.
    Sandve GK; Abul O; Walseng V; Drabløs F
    BMC Bioinformatics; 2007 Jun; 8():193. PubMed ID: 17559676
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 11.