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 *

422 related articles for article (PubMed ID: 27152692)

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

  • 2. Error Tree: A Tree Structure for Hamming and Edit Distances and Wildcards Matching.
    Al-Okaily A
    J Comput Biol; 2015 Dec; 22(12):1118-28. PubMed ID: 26402070
    [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. 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. Encoded expansion: an efficient algorithm to discover identical string motifs.
    Azmi AM; Al-Ssulami A
    PLoS One; 2014; 9(5):e95148. PubMed ID: 24871320
    [TBL] [Abstract][Full Text] [Related]  

  • 6. libFLASM: a software library for fixed-length approximate string matching.
    Ayad LA; Pissis SP; Retha A
    BMC Bioinformatics; 2016 Nov; 17(1):454. PubMed ID: 27832739
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Linear-time computation of minimal absent words using suffix array.
    Barton C; Heliou A; Mouchard L; Pissis SP
    BMC Bioinformatics; 2014 Dec; 15(1):388. PubMed ID: 25526884
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

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

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

  • 15. New algorithms for structure informed genome rearrangement.
    Ozeri E; Zehavi M; Ziv-Ukelson M
    Algorithms Mol Biol; 2023 Dec; 18(1):17. PubMed ID: 38037088
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 19. A Simple Approach to the Reconstruction of a Set of Points from the Multiset of n
    Fomin E
    J Comput Biol; 2016 Dec; 23(12):934-942. PubMed ID: 27310815
    [TBL] [Abstract][Full Text] [Related]  

  • 20. OMPPM: online multiple palindrome pattern matching.
    Kim H; Han YS
    Bioinformatics; 2016 Apr; 32(8):1151-7. PubMed ID: 26677963
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 22.