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 *

79 related articles for article (PubMed ID: 15285903)

  • 41. Approximation and Parameterized Runtime Analysis of Evolutionary Algorithms for the Maximum Cut Problem.
    Zhou Y; Lai X; Li K
    IEEE Trans Cybern; 2015 Aug; 45(8):1491-8. PubMed ID: 25222964
    [TBL] [Abstract][Full Text] [Related]  

  • 42. An unenumerative DNA computing model for vertex coloring problem.
    Xu J; Qiang X; Yang Y; Wang B; Yang D; Luo L; Pan L; Wang S
    IEEE Trans Nanobioscience; 2011 Jun; 10(2):94-8. PubMed ID: 21742570
    [TBL] [Abstract][Full Text] [Related]  

  • 43. Dynamic model based algorithms for screening and genotyping over 100 K SNPs on oligonucleotide microarrays.
    Di X; Matsuzaki H; Webster TA; Hubbell E; Liu G; Dong S; Bartell D; Huang J; Chiles R; Yang G; Shen MM; Kulp D; Kennedy GC; Mei R; Jones KW; Cawley S
    Bioinformatics; 2005 May; 21(9):1958-63. PubMed ID: 15657097
    [TBL] [Abstract][Full Text] [Related]  

  • 44. Predicting RNA secondary structures with arbitrary pseudoknots by maximizing the number of stacking pairs.
    Ieong S; Kao MY; Lam TW; Sung WK; Yiu SM
    J Comput Biol; 2003; 10(6):981-95. PubMed ID: 14980021
    [TBL] [Abstract][Full Text] [Related]  

  • 45. Evaluation of the 124-plex SNP typing microarray for forensic testing.
    Krjutskov K; Viltrop T; Palta P; Metspalu E; Tamm E; Suvi S; Sak K; Merilo A; Sork H; Teek R; Nikopensius T; Kivisild T; Metspalu A
    Forensic Sci Int Genet; 2009 Dec; 4(1):43-8. PubMed ID: 19948333
    [TBL] [Abstract][Full Text] [Related]  

  • 46. Faster heuristics for graph burning.
    Gautam RK; Kare AS; S DB
    Appl Intell (Dordr); 2022; 52(2):1351-1361. PubMed ID: 34764602
    [TBL] [Abstract][Full Text] [Related]  

  • 47. Tractable Cases of (*,2)-Bounded Parsimony Haplotyping.
    Keijsper J; Oosterwijk T
    IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(1):234-47. PubMed ID: 26357092
    [TBL] [Abstract][Full Text] [Related]  

  • 48. Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs.
    Novotná J; Okrasa K; Pilipczuk M; Rzążewski P; van Leeuwen EJ; Walczak B
    Algorithmica; 2021; 83(8):2634-2650. PubMed ID: 34720297
    [TBL] [Abstract][Full Text] [Related]  

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

  • 50. Fast optimal genome tiling with applications to microarray design and homology search.
    Berman P; Bertone P; Dasgupta B; Gerstein M; Kao MY; Snyder M
    J Comput Biol; 2004; 11(4):766-85. PubMed ID: 15579244
    [TBL] [Abstract][Full Text] [Related]  

  • 51. MISAGA: An Algorithm for Mining Interesting Subgraphs in Attributed Graphs.
    He T; Chan KCC
    IEEE Trans Cybern; 2018 May; 48(5):1369-1382. PubMed ID: 28459699
    [TBL] [Abstract][Full Text] [Related]  

  • 52. A memetic algorithm for finding multiple subgraphs that optimally cover an input network.
    He X; Wang Y; Du H; Feldman MW
    PLoS One; 2023; 18(1):e0280506. PubMed ID: 36662749
    [TBL] [Abstract][Full Text] [Related]  

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

  • 54. Two combinatorial optimization problems for SNP discovery using base-specific cleavage and mass spectrometry.
    Chen X; Wu Q; Sun R; Zhang L
    BMC Syst Biol; 2012; 6 Suppl 2(Suppl 2):S5. PubMed ID: 23282116
    [TBL] [Abstract][Full Text] [Related]  

  • 55. New Tools and Connections for Exponential-Time Approximation.
    Bansal N; Chalermsook P; Laekhanukit B; Nanongkai D; Nederlof J
    Algorithmica; 2019; 81(10):3993-4009. PubMed ID: 31496549
    [TBL] [Abstract][Full Text] [Related]  

  • 56. Algorithms for the quantitative Lock/Key model of cytoplasmic incompatibility.
    Calamoneri T; Gastaldello M; Mary A; Sagot MF; Sinaimeri B
    Algorithms Mol Biol; 2020; 15():14. PubMed ID: 32704304
    [TBL] [Abstract][Full Text] [Related]  

  • 57. Splitting Vertices in 2-Layer Graph Drawings.
    Ahmed R; Angelini P; Bekos MA; Battista GD; Kaufmann M; Kindermann P; Kobourov S; Nollenburg M; Symvonis A; Villedieu A; Wallinger M
    IEEE Comput Graph Appl; 2023; 43(3):24-35. PubMed ID: 37023163
    [TBL] [Abstract][Full Text] [Related]  

  • 58. Positional sequencing by hybridization.
    Hannenhalli S; Feldman W; Lewis HF; Skiena SS; Pevzner PA
    Comput Appl Biosci; 1996 Feb; 12(1):19-24. PubMed ID: 8670615
    [TBL] [Abstract][Full Text] [Related]  

  • 59. Efficient Design of Compact Unstructured RNA Libraries Covering All k-mers.
    Orenstein Y; Berger B
    J Comput Biol; 2016 Feb; 23(2):67-79. PubMed ID: 26713687
    [TBL] [Abstract][Full Text] [Related]  

  • 60. A parallel improvement algorithm for the bipartite subgraph problem.
    Lee KC; Funabiki N; Takefuji Y
    IEEE Trans Neural Netw; 1992; 3(1):139-45. PubMed ID: 18276415
    [TBL] [Abstract][Full Text] [Related]  

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