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)

  • 21. Penalized and weighted K-means for clustering with scattered objects and prior information in high-throughput biological data.
    Tseng GC
    Bioinformatics; 2007 Sep; 23(17):2247-55. PubMed ID: 17597097
    [TBL] [Abstract][Full Text] [Related]  

  • 22. An exact algorithm for the zero exemplar breakpoint distance problem.
    Zhu D; Wang L
    IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(6):1469-77. PubMed ID: 24407305
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Algorithms for phylogenetic footprinting.
    Blanchette M; Schwikowski B; Tompa M
    J Comput Biol; 2002; 9(2):211-23. PubMed ID: 12015878
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Classification of bioinformatics workflows using weighted versions of partitioning and hierarchical clustering algorithms.
    Lord E; Diallo AB; Makarenkov V
    BMC Bioinformatics; 2015 Mar; 16():68. PubMed ID: 25887434
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Finding reproducible cluster partitions for the k-means algorithm.
    Lisboa PJ; Etchells TA; Jarman IH; Chambers SJ
    BMC Bioinformatics; 2013; 14 Suppl 1(Suppl 1):S8. PubMed ID: 23369085
    [TBL] [Abstract][Full Text] [Related]  

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

  • 27. Mining subspace clusters from DNA microarray data using large itemset techniques.
    Chang YI; Chen JR; Tsai YC
    J Comput Biol; 2009 May; 16(5):745-68. PubMed ID: 19432542
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Is optimal solution of every NP-complete or NP-hard problem determined from its characteristic for DNA-based computing.
    Guo M; Chang WL; Ho M; Lu J; Cao J
    Biosystems; 2005 Apr; 80(1):71-82. PubMed ID: 15740836
    [TBL] [Abstract][Full Text] [Related]  

  • 29. K-Boost: a scalable algorithm for high-quality clustering of microarray gene expression data.
    Geraci F; Leoncini M; Montangero M; Pellegrini M; Renda ME
    J Comput Biol; 2009 Jun; 16(6):859-73. PubMed ID: 19522668
    [TBL] [Abstract][Full Text] [Related]  

  • 30. On the nearest neighbour interchange distance between evolutionary trees.
    Li M; Tromp J; Zhang L
    J Theor Biol; 1996 Oct; 182(4):463-7. PubMed ID: 8944893
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Error Tree: A Tree Structure for Hamming and Edit Distances and Wildcards Matching.
    Al-Okaily A
    J Comput Biol; 2015 Dec; 22(12):1118-28. PubMed ID: 26402070
    [TBL] [Abstract][Full Text] [Related]  

  • 32. On univariate optimal partitioning by complete enumeration.
    Aubry P
    MethodsX; 2023; 10():102154. PubMed ID: 37091960
    [TBL] [Abstract][Full Text] [Related]  

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

  • 34. Bioinspired Quantum Oracle Circuits for Biomolecular Solutions of the Maximum Cut Problem.
    Chang WL; Wong R; Chen YH; Chung WY; Chen JC; Vasilakos AV
    IEEE Trans Nanobioscience; 2024 Jul; 23(3):499-506. PubMed ID: 38687648
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Combined Mapping of Multiple clUsteriNg ALgorithms (COMMUNAL): A Robust Method for Selection of Cluster Number, K.
    Sweeney TE; Chen AC; Gevaert O
    Sci Rep; 2015 Nov; 5():16971. PubMed ID: 26581809
    [TBL] [Abstract][Full Text] [Related]  

  • 36. FLOCK provides reliable solutions to the "number of populations" problem.
    Duchesne P; Turgeon J
    J Hered; 2012; 103(5):734-43. PubMed ID: 22615162
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Bicriterion cluster analysis.
    Delattre M; Hansen P
    IEEE Trans Pattern Anal Mach Intell; 1980 Apr; 2(4):277-91. PubMed ID: 21868904
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Finding the mean in a partition distribution.
    Glassen TJ; Oertzen TV; Konovalov DA
    BMC Bioinformatics; 2018 Oct; 19(1):375. PubMed ID: 30314432
    [TBL] [Abstract][Full Text] [Related]  

  • 39. A Condition-Enumeration Tree method for mining biclusters from DNA microarray data sets.
    Chen JR; Chang YI
    Biosystems; 2009 Jul; 97(1):44-59. PubMed ID: 19393714
    [TBL] [Abstract][Full Text] [Related]  

  • 40. An algorithm to enumerate sorting reversals for signed permutations.
    Siepel AC
    J Comput Biol; 2003; 10(3-4):575-97. PubMed ID: 12935346
    [TBL] [Abstract][Full Text] [Related]  

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