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 *

152 related articles for article (PubMed ID: 20122182)

  • 1. Fast motif recognition via application of statistical thresholds.
    Boucher C; King J
    BMC Bioinformatics; 2010 Jan; 11 Suppl 1(Suppl 1):S11. PubMed ID: 20122182
    [TBL] [Abstract][Full Text] [Related]  

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

  • 3. Closest string with outliers.
    Boucher C; Ma B
    BMC Bioinformatics; 2011 Feb; 12 Suppl 1(Suppl 1):S55. PubMed ID: 21342588
    [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. 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]  

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

  • 7. Prediction of cis-regulatory elements: from high-information content analysis to motif identification.
    Li G; Lu J; Olman V; Xu Y
    J Bioinform Comput Biol; 2007 Aug; 5(4):817-38. PubMed ID: 17787058
    [TBL] [Abstract][Full Text] [Related]  

  • 8. DNA motif representation with nucleotide dependency.
    Chin F; Leung HC
    IEEE/ACM Trans Comput Biol Bioinform; 2008; 5(1):110-9. PubMed ID: 18245880
    [TBL] [Abstract][Full Text] [Related]  

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

  • 10. On the hardness of counting and sampling center strings.
    Boucher C; Omar M
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(6):1843-6. PubMed ID: 22641713
    [TBL] [Abstract][Full Text] [Related]  

  • 11. An improved heuristic algorithm for finding motif signals in DNA sequences.
    Huang CW; Lee WS; Hsieh SY
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(4):959-75. PubMed ID: 20855921
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Swiftly computing center strings.
    Hufsky F; Kuchenbecker L; Jahn K; Stoye J; Böcker S
    BMC Bioinformatics; 2011 Apr; 12():106. PubMed ID: 21504573
    [TBL] [Abstract][Full Text] [Related]  

  • 13. MoTeX-II: structured MoTif eXtraction from large-scale datasets.
    Pissis SP
    BMC Bioinformatics; 2014 Jul; 15():235. PubMed ID: 25004797
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. A novel Bayesian DNA motif comparison method for clustering and retrieval.
    Habib N; Kaplan T; Margalit H; Friedman N
    PLoS Comput Biol; 2008 Feb; 4(2):e1000010. PubMed ID: 18463706
    [TBL] [Abstract][Full Text] [Related]  

  • 16. A Gibbs sampler for identification of symmetrically structured, spaced DNA motifs with improved estimation of the signal length.
    Favorov AV; Gelfand MS; Gerasimova AV; Ravcheev DA; Mironov AA; Makeev VJ
    Bioinformatics; 2005 May; 21(10):2240-5. PubMed ID: 15728117
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. Short superstrings and the structure of overlapping strings.
    Armen C; Stein C
    J Comput Biol; 1995; 2(2):307-32. PubMed ID: 7497131
    [TBL] [Abstract][Full Text] [Related]  

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

  • 20. A profile-based deterministic sequential Monte Carlo algorithm for motif discovery.
    Liang KC; Wang X; Anastassiou D
    Bioinformatics; 2008 Jan; 24(1):46-55. PubMed ID: 18024972
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 8.