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 *

645 related articles for article (PubMed ID: 22468708)

  • 41. Clustering short time series gene expression data.
    Ernst J; Nau GJ; Bar-Joseph Z
    Bioinformatics; 2005 Jun; 21 Suppl 1():i159-68. PubMed ID: 15961453
    [TBL] [Abstract][Full Text] [Related]  

  • 42. A new parallel DNA algorithm to solve the task scheduling problem based on inspired computational model.
    Wang Z; Ji Z; Wang X; Wu T; Huang W
    Biosystems; 2017 Dec; 162():59-65. PubMed ID: 28890344
    [TBL] [Abstract][Full Text] [Related]  

  • 43. A parallel algorithm for solving the n-queens problem based on inspired computational model.
    Wang Z; Huang D; Tan J; Liu T; Zhao K; Li L
    Biosystems; 2015 May; 131():22-9. PubMed ID: 25817410
    [TBL] [Abstract][Full Text] [Related]  

  • 44. Computing a smallest multilabeled phylogenetic tree from rooted triplets.
    Guillemot S; Jansson J; Sung WK
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(4):1141-7. PubMed ID: 20733243
    [TBL] [Abstract][Full Text] [Related]  

  • 45. Computing the partition function and sampling for saturated secondary structures of RNA, with respect to the Turner energy model.
    Waldispühl J; Clote P
    J Comput Biol; 2007 Mar; 14(2):190-215. PubMed ID: 17456015
    [TBL] [Abstract][Full Text] [Related]  

  • 46. Towards optimally multiplexed applications of universal arrays.
    Ben-Dor A; Hartman T; Karp RM; Schwikowski B; Sharan R; Yakhini Z
    J Comput Biol; 2004; 11(2-3):476-92. PubMed ID: 15285903
    [TBL] [Abstract][Full Text] [Related]  

  • 47. Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage.
    Hüffner F; Komusiewicz C; Liebtrau A; Niedermeier R
    IEEE/ACM Trans Comput Biol Bioinform; 2014; 11(3):455-67. PubMed ID: 26356014
    [TBL] [Abstract][Full Text] [Related]  

  • 48. Communities of solutions in single solution clusters of a random K-satisfiability formula.
    Zhou H; Ma H
    Phys Rev E Stat Nonlin Soft Matter Phys; 2009 Dec; 80(6 Pt 2):066108. PubMed ID: 20365232
    [TBL] [Abstract][Full Text] [Related]  

  • 49. Robust multi-scale clustering of large DNA microarray datasets with the consensus algorithm.
    Grotkjaer T; Winther O; Regenberg B; Nielsen J; Hansen LK
    Bioinformatics; 2006 Jan; 22(1):58-67. PubMed ID: 16257984
    [TBL] [Abstract][Full Text] [Related]  

  • 50. Distance-based clustering of CGH data.
    Liu J; Mohammed J; Carter J; Ranka S; Kahveci T; Baudis M
    Bioinformatics; 2006 Aug; 22(16):1971-8. PubMed ID: 16705014
    [TBL] [Abstract][Full Text] [Related]  

  • 51. Initializing partition-optimization algorithms.
    Maitra R
    IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(1):144-57. PubMed ID: 19179708
    [TBL] [Abstract][Full Text] [Related]  

  • 52. Estimation and marginalization using the Kikuchi approximation methods.
    Pakzad P; Anantharam V
    Neural Comput; 2005 Aug; 17(8):1836-73. PubMed ID: 15969920
    [TBL] [Abstract][Full Text] [Related]  

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

  • 54. A novel bio-heuristic computing algorithm to solve the capacitated vehicle routing problem based on Adleman-Lipton model.
    Wang Z; Ren X; Ji Z; Huang W; Wu T
    Biosystems; 2019 Oct; 184():103997. PubMed ID: 31369836
    [TBL] [Abstract][Full Text] [Related]  

  • 55. A Simple Algorithm for Finding All k-Edge-Connected Components.
    Wang T; Zhang Y; Chin FY; Ting HF; Tsin YH; Poon SH
    PLoS One; 2015; 10(9):e0136264. PubMed ID: 26368134
    [TBL] [Abstract][Full Text] [Related]  

  • 56. Geometric crossovers for multiway graph partitioning.
    Moraglio A; Kim YH; Yoon Y; Moon BR
    Evol Comput; 2007; 15(4):445-74. PubMed ID: 18021015
    [TBL] [Abstract][Full Text] [Related]  

  • 57. Iterative class discovery and feature selection using Minimal Spanning Trees.
    Varma S; Simon R
    BMC Bioinformatics; 2004 Sep; 5():126. PubMed ID: 15355552
    [TBL] [Abstract][Full Text] [Related]  

  • 58. On the taxonomy of optimization problems under estimation of distribution algorithms.
    Echegoyen C; Mendiburu A; Santana R; Lozano JA
    Evol Comput; 2013; 21(3):471-95. PubMed ID: 23136917
    [TBL] [Abstract][Full Text] [Related]  

  • 59. Detection of the dominant direction of information flow and feedback links in densely interconnected regulatory networks.
    Ispolatov I; Maslov S
    BMC Bioinformatics; 2008 Oct; 9():424. PubMed ID: 18842147
    [TBL] [Abstract][Full Text] [Related]  

  • 60. A Dynamic Programming Algorithm For (1,2)-Exemplar Breakpoint Distance.
    Wei Z; Zhu D; Wang L
    J Comput Biol; 2015 Jul; 22(7):666-76. PubMed ID: 26161597
    [TBL] [Abstract][Full Text] [Related]  

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