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 *

150 related articles for article (PubMed ID: 22024209)

  • 1. PMS5: an efficient exact algorithm for the (ℓ, d)-motif finding problem.
    Dinh H; Rajasekaran S; Kundeti VK
    BMC Bioinformatics; 2011 Oct; 12():410. PubMed ID: 22024209
    [TBL] [Abstract][Full Text] [Related]  

  • 2. 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]  

  • 3. A speedup technique for (l, d)-motif finding algorithms.
    Rajasekaran S; Dinh H
    BMC Res Notes; 2011 Mar; 4():54. PubMed ID: 21385438
    [TBL] [Abstract][Full Text] [Related]  

  • 4. 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]  

  • 5. 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]  

  • 6. PMS6: a fast algorithm for motif discovery.
    Bandyopadhyay S; Sahni S; Rajasekaran S
    Int J Bioinform Res Appl; 2014; 10(4-5):369-83. PubMed ID: 24989858
    [TBL] [Abstract][Full Text] [Related]  

  • 7. 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]  

  • 8. PMS: a panoptic motif search tool.
    Dinh H; Rajasekaran S
    PLoS One; 2013; 8(12):e80660. PubMed ID: 24324619
    [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. 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]  

  • 11. PMS6: A Fast Algorithm for Motif Discovery.
    Bandyopadhyay S; Sahni S; Rajasekaran S
    IEEE Int Conf Comput Adv Bio Med Sci; 2012; ():1-6. PubMed ID: 23959399
    [TBL] [Abstract][Full Text] [Related]  

  • 12. A hybrid method for the exact planted (l, d) motif finding problem and its parallelization.
    Abbas MM; Abouelhoda M; Bahig HM
    BMC Bioinformatics; 2012; 13 Suppl 17(Suppl 17):S10. PubMed ID: 23281969
    [TBL] [Abstract][Full Text] [Related]  

  • 13. RefSelect: a reference sequence selection algorithm for planted (l, d) motif search.
    Yu Q; Huo H; Zhao R; Feng D; Vitter JS; Huan J
    BMC Bioinformatics; 2016 Jul; 17 Suppl 9(Suppl 9):266. PubMed ID: 27454113
    [TBL] [Abstract][Full Text] [Related]  

  • 14. A fast weak motif-finding algorithm based on community detection in graphs.
    Jia C; Carson MB; Yu J
    BMC Bioinformatics; 2013 Jul; 14():227. PubMed ID: 23865838
    [TBL] [Abstract][Full Text] [Related]  

  • 15. 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]  

  • 16. A cluster refinement algorithm for motif discovery.
    Li G; Chan TM; Leung KS; Lee KH
    IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(4):654-68. PubMed ID: 21030733
    [TBL] [Abstract][Full Text] [Related]  

  • 17. qPMS9: an efficient algorithm for quorum Planted Motif Search.
    Nicolae M; Rajasekaran S
    Sci Rep; 2015 Jan; 5():7813. PubMed ID: 25589474
    [TBL] [Abstract][Full Text] [Related]  

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

  • 19. ET-Motif: Solving the Exact (l, d)-Planted Motif Problem Using Error Tree Structure.
    Al-Okaily A; Huang CH
    J Comput Biol; 2016 Jul; 23(7):615-23. PubMed ID: 27152692
    [TBL] [Abstract][Full Text] [Related]  

  • 20. 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]  

    [Next]    [New Search]
    of 8.