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 *

142 related articles for article (PubMed ID: 24479443)

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

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

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

  • 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. Freezing firefly algorithm for efficient planted (ℓ, d) motif search.
    Theepalakshmi P; Reddy US
    Med Biol Eng Comput; 2022 Feb; 60(2):511-530. PubMed ID: 35020123
    [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. 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]  

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

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

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

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

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

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

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

  • 18. SamSelect: a sample sequence selection algorithm for quorum planted motif search on large DNA datasets.
    Yu Q; Wei D; Huo H
    BMC Bioinformatics; 2018 Jun; 19(1):228. PubMed ID: 29914360
    [TBL] [Abstract][Full Text] [Related]  

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

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

    [Next]    [New Search]
    of 8.