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 *

166 related articles for article (PubMed ID: 22641713)

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

  • 62. Structure of the space of taboo-free sequences.
    Manuel C; von Haeseler A
    J Math Biol; 2020 Nov; 81(4-5):1029-1057. PubMed ID: 32940748
    [TBL] [Abstract][Full Text] [Related]  

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

  • 64. Optimal algorithms for the interval location problem with range constraints on length and average.
    Hsieh YH; Yu CC; Wang BF
    IEEE/ACM Trans Comput Biol Bioinform; 2008; 5(2):281-90. PubMed ID: 18451437
    [TBL] [Abstract][Full Text] [Related]  

  • 65. On the application of integer arithmetic in nucleotide sequence analysis.
    Mac Dónaill DA
    Comput Appl Biosci; 1995 Oct; 11(5):567-9. PubMed ID: 8590182
    [TBL] [Abstract][Full Text] [Related]  

  • 66. A novel method for accurate one-dimensional protein structure prediction based on fragment matching.
    Zhou T; Shu N; Hovmöller S
    Bioinformatics; 2010 Feb; 26(4):470-7. PubMed ID: 20007252
    [TBL] [Abstract][Full Text] [Related]  

  • 67. Online algorithm for the self-organizing map of symbol strings.
    Somervuo PJ
    Neural Netw; 2004; 17(8-9):1231-9. PubMed ID: 15555863
    [TBL] [Abstract][Full Text] [Related]  

  • 68. Key-string algorithm--novel approach to computational analysis of repetitive sequences in human centromeric DNA.
    Rosandić M; Paar V; Gluncić M; Basar I; Pavin N
    Croat Med J; 2003 Aug; 44(4):386-406. PubMed ID: 12950141
    [TBL] [Abstract][Full Text] [Related]  

  • 69. Mutual information without the influence of phylogeny or entropy dramatically improves residue contact prediction.
    Dunn SD; Wahl LM; Gloor GB
    Bioinformatics; 2008 Feb; 24(3):333-40. PubMed ID: 18057019
    [TBL] [Abstract][Full Text] [Related]  

  • 70. Using sequence compression to speedup probabilistic profile matching.
    Freschi V; Bogliolo A
    Bioinformatics; 2005 May; 21(10):2225-9. PubMed ID: 15713733
    [TBL] [Abstract][Full Text] [Related]  

  • 71. Fixed-parameter tractability of the maximum agreement supertree problem.
    Guillemot S; Berry V
    IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(2):342-53. PubMed ID: 20431153
    [TBL] [Abstract][Full Text] [Related]  

  • 72. Can we recover a sequence, just knowing all its subsequences of given length?
    Guénoche A
    Comput Appl Biosci; 1992 Dec; 8(6):569-74. PubMed ID: 1468013
    [TBL] [Abstract][Full Text] [Related]  

  • 73. On the elusiveness of clusters.
    Kelk SM; Scornavacca C; van Iersel L
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(2):517-34. PubMed ID: 21968961
    [TBL] [Abstract][Full Text] [Related]  

  • 74. Iconic indexing by 2-d strings.
    Chang SK; Shi QY; Yan CW
    IEEE Trans Pattern Anal Mach Intell; 1987 Mar; 9(3):413-28. PubMed ID: 22516634
    [TBL] [Abstract][Full Text] [Related]  

  • 75. Branch and bound computation of exact p-values.
    Bejerano G
    Bioinformatics; 2006 Sep; 22(17):2158-9. PubMed ID: 16895926
    [TBL] [Abstract][Full Text] [Related]  

  • 76. What is a hidden Markov model?
    Eddy SR
    Nat Biotechnol; 2004 Oct; 22(10):1315-6. PubMed ID: 15470472
    [No Abstract]   [Full Text] [Related]  

  • 77. An Integer Programming Formulation of the Minimum Common String Partition Problem.
    Ferdous SM; Rahman MS
    PLoS One; 2015; 10(7):e0130266. PubMed ID: 26134848
    [TBL] [Abstract][Full Text] [Related]  

  • 78. Robustness of topological supertree methods for reconciling dense incompatible data.
    Willson SJ
    IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(1):62-75. PubMed ID: 19179699
    [TBL] [Abstract][Full Text] [Related]  

  • 79. Optimal amnesic probabilistic automata or how to learn and classify proteins in linear time and space.
    Apostolico A; Bejerano G
    J Comput Biol; 2000; 7(3-4):381-93. PubMed ID: 11108469
    [TBL] [Abstract][Full Text] [Related]  

  • 80. Algorithms for optimal protein structure alignment.
    Poleksic A
    Bioinformatics; 2009 Nov; 25(21):2751-6. PubMed ID: 19734152
    [TBL] [Abstract][Full Text] [Related]  

    [Previous]   [Next]    [New Search]
    of 9.