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 *

158 related articles for article (PubMed ID: 19478010)

  • 1. Efficient exact motif discovery.
    Marschall T; Rahmann S
    Bioinformatics; 2009 Jun; 25(12):i356-64. PubMed ID: 19478010
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Conservative extraction of over-represented extensible motifs.
    Apostolico A; Comin M; Parida L
    Bioinformatics; 2005 Jun; 21 Suppl 1():i9-18. PubMed ID: 15961503
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Faster exact Markovian probability functions for motif occurrences: a DFA-only approach.
    Ribeca P; Raineri E
    Bioinformatics; 2008 Dec; 24(24):2839-48. PubMed ID: 18845582
    [TBL] [Abstract][Full Text] [Related]  

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

  • 5. Efficient representation and P-value computation for high-order Markov motifs.
    da Fonseca PG; Guimarães KS; Sagot MF
    Bioinformatics; 2008 Aug; 24(16):i160-6. PubMed ID: 18689819
    [TBL] [Abstract][Full Text] [Related]  

  • 6. An efficient method for significant motifs discovery from multiple DNA sequences.
    Al-Ssulami AM; Azmi AM; Mathkour H
    J Bioinform Comput Biol; 2017 Aug; 15(4):1750014. PubMed ID: 28571483
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Estimation and efficient computation of the true probability of recurrence of short linear protein sequence motifs in unrelated proteins.
    Davey NE; Edwards RJ; Shields DC
    BMC Bioinformatics; 2010 Jan; 11():14. PubMed ID: 20055997
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Fast and accurate discovery of degenerate linear motifs in protein sequences.
    Kelil A; Dubreuil B; Levy ED; Michnick SW
    PLoS One; 2014; 9(9):e106081. PubMed ID: 25207816
    [TBL] [Abstract][Full Text] [Related]  

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

  • 10. Fast and exact quantification of motif occurrences in biological sequences.
    Prosperi M; Marini S; Boucher C
    BMC Bioinformatics; 2021 Sep; 22(1):445. PubMed ID: 34537012
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Computing the P-value of the information content from an alignment of multiple sequences.
    Nagarajan N; Jones N; Keich U
    Bioinformatics; 2005 Jun; 21 Suppl 1():i311-8. PubMed ID: 15961473
    [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. 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]  

  • 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 Monte Carlo EM algorithm for de novo motif discovery in biomolecular sequences.
    Bi C
    IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(3):370-86. PubMed ID: 19644166
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. Discriminative motif discovery in DNA and protein sequences using the DEME algorithm.
    Redhead E; Bailey TL
    BMC Bioinformatics; 2007 Oct; 8():385. PubMed ID: 17937785
    [TBL] [Abstract][Full Text] [Related]  

  • 18. MCAT: Motif Combining and Association Tool.
    Yang Y; Robertson JA; Guo Z; Martinez J; Coghlan C; Heath LS
    J Comput Biol; 2019 Jan; 26(1):1-15. PubMed ID: 30418034
    [TBL] [Abstract][Full Text] [Related]  

  • 19. An Algorithm for Motif Discovery with Iteration on Lengths of Motifs.
    Fan Y; Wu W; Yang J; Yang W; Liu R
    IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(1):136-41. PubMed ID: 26357084
    [TBL] [Abstract][Full Text] [Related]  

  • 20. RecMotif: a novel fast algorithm for weak motif discovery.
    Sun HQ; Low MY; Hsu WJ; Rajapakse JC
    BMC Bioinformatics; 2010 Dec; 11 Suppl 11(Suppl 11):S8. PubMed ID: 21172058
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 8.