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 *

128 related articles for article (PubMed ID: 26677963)

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

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

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

  • 4. Improved algorithms for approximate string matching (extended abstract).
    Papamichail D; Papamichail G
    BMC Bioinformatics; 2009 Jan; 10 Suppl 1(Suppl 1):S10. PubMed ID: 19208109
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 8. Efficient Computation of Longest Common Subsequences with Multiple Substring Inclusive Constraints.
    Wang X; Wang L; Zhu D
    J Comput Biol; 2019 Sep; 26(9):938-947. PubMed ID: 30958704
    [No Abstract]   [Full Text] [Related]  

  • 9. A Simple, Fast, Filter-Based Algorithm for Approximate Circular Pattern Matching.
    Azim MA; Iliopoulos CS; Rahman MS; Samiruzzaman M
    IEEE Trans Nanobioscience; 2016 Mar; 15(2):93-100. PubMed ID: 26992174
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Finding significant matches of position weight matrices in linear time.
    Pizzi C; Rastas P; Ukkonen E
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(1):69-79. PubMed ID: 21071798
    [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. Palindrome analyser - A new web-based server for predicting and evaluating inverted repeats in nucleotide sequences.
    Brázda V; Kolomazník J; Lýsek J; Hároníková L; Coufal J; Št'astný J
    Biochem Biophys Res Commun; 2016 Sep; 478(4):1739-45. PubMed ID: 27603574
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Complex analyses of inverted repeats in mitochondrial genomes revealed their importance and variability.
    Cechová J; Lýsek J; Bartas M; Brázda V
    Bioinformatics; 2018 Apr; 34(7):1081-1085. PubMed ID: 29126205
    [TBL] [Abstract][Full Text] [Related]  

  • 14. The WM-q multiple exact string matching algorithm for DNA sequences.
    Karcioglu AA; Bulut H
    Comput Biol Med; 2021 Sep; 136():104656. PubMed ID: 34333228
    [TBL] [Abstract][Full Text] [Related]  

  • 15. A MATLAB-based tool for accurate detection of perfect overlapping and nested inverted repeats in DNA sequences.
    Sreeskandarajan S; Flowers MM; Karro JE; Liang C
    Bioinformatics; 2014 Mar; 30(6):887-8. PubMed ID: 24215021
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Two Efficient Techniques to Find Approximate Overlaps between Sequences.
    Haj Rachid M
    Biomed Res Int; 2017; 2017():2731385. PubMed ID: 28293632
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Searching protein 3-D structures in linear time.
    Shibuya T
    J Comput Biol; 2010 Mar; 17(3):203-19. PubMed ID: 20377441
    [TBL] [Abstract][Full Text] [Related]  

  • 18. E-MEM: efficient computation of maximal exact matches for very large genomes.
    Khiste N; Ilie L
    Bioinformatics; 2015 Feb; 31(4):509-14. PubMed ID: 25399029
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Local Exact Pattern Matching for Non-Fixed RNA Structures.
    Amit M; Backofen R; Heyne S; Landau GM; Möhl M; Otto C; Will S
    IEEE/ACM Trans Comput Biol Bioinform; 2014; 11(1):219-30. PubMed ID: 26355520
    [TBL] [Abstract][Full Text] [Related]  

  • 20. An O(N2) algorithm for discovering optimal Boolean pattern pairs.
    Bannai H; Hyyrö H; Shinohara A; Takeda M; Nakai K; Miyano S
    IEEE/ACM Trans Comput Biol Bioinform; 2004; 1(4):159-70. PubMed ID: 17051698
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.