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 *

121 related articles for article (PubMed ID: 17456012)

  • 41. Evolution and similarity evaluation of protein structures in contact map space.
    Gupta N; Mangal N; Biswas S
    Proteins; 2005 May; 59(2):196-204. PubMed ID: 15726585
    [TBL] [Abstract][Full Text] [Related]  

  • 42. Spatial codes and the hardness of string folding problems.
    Nayak A; Sinclair A; Zwick U
    J Comput Biol; 1999; 6(1):13-36. PubMed ID: 10223662
    [TBL] [Abstract][Full Text] [Related]  

  • 43. Comprehensive identification of "druggable" protein ligand binding sites.
    An J; Totrov M; Abagyan R
    Genome Inform; 2004; 15(2):31-41. PubMed ID: 15706489
    [TBL] [Abstract][Full Text] [Related]  

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

  • 45. A fast hierarchical clustering algorithm for large-scale protein sequence data sets.
    Szilágyi SM; Szilágyi L
    Comput Biol Med; 2014 May; 48():94-101. PubMed ID: 24657908
    [TBL] [Abstract][Full Text] [Related]  

  • 46. Sorting signed permutations by inversions in O(nlogn) time.
    Swenson KM; Rajan V; Lin Y; Moret BM
    J Comput Biol; 2010 Mar; 17(3):489-501. PubMed ID: 20377459
    [TBL] [Abstract][Full Text] [Related]  

  • 47. Finding nearly optimal GDT scores.
    Li SC; Bu D; Xu J; Li M
    J Comput Biol; 2011 May; 18(5):693-704. PubMed ID: 21554017
    [TBL] [Abstract][Full Text] [Related]  

  • 48. Fast computation of distance estimators.
    Elias I; Lagergren J
    BMC Bioinformatics; 2007 Mar; 8():89. PubMed ID: 17355623
    [TBL] [Abstract][Full Text] [Related]  

  • 49. Multiple methods for protein side chain packing using maximum weight cliques.
    Brown JB; Dukka Bahadur KC; Tomita E; Akutsu T
    Genome Inform; 2006; 17(1):3-12. PubMed ID: 17503351
    [TBL] [Abstract][Full Text] [Related]  

  • 50. Dynamic Graph Stream Algorithms in
    Huang Z; Peng P
    Algorithmica; 2019; 81(5):1965-1987. PubMed ID: 31057194
    [TBL] [Abstract][Full Text] [Related]  

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

  • 52. Efficiently computing the Robinson-Foulds metric.
    Pattengale ND; Gottlieb EJ; Moret BM
    J Comput Biol; 2007; 14(6):724-35. PubMed ID: 17691890
    [TBL] [Abstract][Full Text] [Related]  

  • 53. An efficient algorithm for finding short approximate non-tandem repeats.
    Adebiyi EF; Jiang T; Kaufmann M
    Bioinformatics; 2001; 17 Suppl 1():S5-S12. PubMed ID: 11472987
    [TBL] [Abstract][Full Text] [Related]  

  • 54. Structural Target Controllability of Linear Networks.
    Czeizler E; Wu KC; Gratie C; Kanhaiya K; Petre I
    IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(4):1217-1228. PubMed ID: 29994605
    [TBL] [Abstract][Full Text] [Related]  

  • 55. New algorithms for maximum disjoint paths based on tree-likeness.
    Fleszar K; Mnich M; Spoerhase J
    Math Program; 2018; 171(1):433-461. PubMed ID: 30956356
    [TBL] [Abstract][Full Text] [Related]  

  • 56. Discovering topological motifs using a compact notation.
    Parida L
    J Comput Biol; 2007 Apr; 14(3):300-23. PubMed ID: 17563313
    [TBL] [Abstract][Full Text] [Related]  

  • 57. Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms.
    Friedrich T; Neumann F
    Evol Comput; 2015; 23(4):543-58. PubMed ID: 26135719
    [TBL] [Abstract][Full Text] [Related]  

  • 58. Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds.
    Bansal N; Oosterwijk T; Vredeveld T; van der Zwaan R
    Algorithmica; 2016; 76(4):1077-1096. PubMed ID: 32355383
    [TBL] [Abstract][Full Text] [Related]  

  • 59. Protein domain decomposition using a graph-theoretic approach.
    Xu Y; Xu D; Gabow HN
    Bioinformatics; 2000 Dec; 16(12):1091-104. PubMed ID: 11159328
    [TBL] [Abstract][Full Text] [Related]  

  • 60. Fast Algorithms for Computing Path-Difference Distances.
    Wang BF; Li CY
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(2):569-582. PubMed ID: 29993953
    [TBL] [Abstract][Full Text] [Related]  

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