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 *

86 related articles for article (PubMed ID: 9783204)

  • 1. Compression of strings with approximate repeats.
    Allison L; Edgoose T; Dix TI
    Proc Int Conf Intell Syst Mol Biol; 1998; 6():8-16. PubMed ID: 9783204
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Detection of significant patterns by compression algorithms: the case of approximate tandem repeats in DNA sequences.
    Rivals E; Delgrange O; Delahaye JP; Dauchet M; Delorme MO; Hénaut A; Ollivier E
    Comput Appl Biosci; 1997 Apr; 13(2):131-6. PubMed ID: 9146959
    [TBL] [Abstract][Full Text] [Related]  

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

  • 4. Sequence complexity for biological sequence analysis.
    Allison L; Stern L; Edgoose T; Dix TI
    Comput Chem; 2000 Jan; 24(1):43-55. PubMed ID: 10642879
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Significantly lower entropy estimates for natural DNA sequences.
    Loewenstern D; Yianilos PN
    J Comput Biol; 1999; 6(1):125-42. PubMed ID: 10223669
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Reconstructing strings from substrings.
    Skiena SS; Sundaram G
    J Comput Biol; 1995; 2(2):333-53. PubMed ID: 7497132
    [TBL] [Abstract][Full Text] [Related]  

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

  • 8. An algorithm for approximate tandem repeats.
    Landau GM; Schmidt JP; Sokol D
    J Comput Biol; 2001; 8(1):1-18. PubMed ID: 11339903
    [TBL] [Abstract][Full Text] [Related]  

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

  • 10. Identifying satellites and periodic repetitions in biological sequences.
    Sagot MF; Myers EW
    J Comput Biol; 1998; 5(3):539-53. PubMed ID: 9773349
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Calculating the exact probability of language-like patterns in biomolecular sequences.
    Atteson K
    Proc Int Conf Intell Syst Mol Biol; 1998; 6():17-24. PubMed ID: 9783205
    [TBL] [Abstract][Full Text] [Related]  

  • 12. [Cloning of segments of the Drosophila melanogaster genome using artificial chromosomes of the yeast Saccharomyces cerevisiae].
    Kogan GL; Filipp D; Arman IP; Leĭbovich BA; Beliaeva ES
    Genetika; 1991 Aug; 27(8):1316-23. PubMed ID: 1761208
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Inverted and mirror repeats in model nucleotide sequences.
    Lillo F; Spanò M
    Phys Rev E Stat Nonlin Soft Matter Phys; 2007 Oct; 76(4 Pt 1):041914. PubMed ID: 17995033
    [TBL] [Abstract][Full Text] [Related]  

  • 14. PhyME: a probabilistic algorithm for finding motifs in sets of orthologous sequences.
    Sinha S; Blanchette M; Tompa M
    BMC Bioinformatics; 2004 Oct; 5():170. PubMed ID: 15511292
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Creation of ARS activity in yeast through iteration of non-functional sequences.
    Zweifel SG; Fangman WL
    Yeast; 1990; 6(3):179-86. PubMed ID: 2161596
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Approximate robust policy iteration using multilayer perceptron neural networks for discounted infinite-horizon Markov decision processes with uncertain correlated transition matrices.
    Li B; Si J
    IEEE Trans Neural Netw; 2010 Aug; 21(8):1270-80. PubMed ID: 20601311
    [TBL] [Abstract][Full Text] [Related]  

  • 17. The context-tree kernel for strings.
    Cuturi M; Vert JP
    Neural Netw; 2005 Oct; 18(8):1111-23. PubMed ID: 16198086
    [TBL] [Abstract][Full Text] [Related]  

  • 18. TA-repeat microsatellites are closely associated with ARS consensus sequences in yeast chromosome III.
    Valle G
    Yeast; 1993 Jul; 9(7):753-9. PubMed ID: 8368009
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Online learning with hidden markov models.
    Mongillo G; Deneve S
    Neural Comput; 2008 Jul; 20(7):1706-16. PubMed ID: 18254694
    [TBL] [Abstract][Full Text] [Related]  

  • 20. A constraint-based evolutionary learning approach to the expectation maximization for optimal estimation of the hidden Markov model for speech signal modeling.
    Huda S; Yearwood J; Togneri R
    IEEE Trans Syst Man Cybern B Cybern; 2009 Feb; 39(1):182-97. PubMed ID: 19068441
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 5.