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 *

69 related articles for article (PubMed ID: 8790467)

  • 1. A subgraph problem from restriction maps of DNA.
    Wang C
    J Comput Biol; 1994; 1(3):227-34. PubMed ID: 8790467
    [TBL] [Abstract][Full Text] [Related]  

  • 2. An annealed chaotic maximum neural network for bipartite subgraph problem.
    Wang J; Tang Z; Wang R
    Int J Neural Syst; 2004 Apr; 14(2):107-16. PubMed ID: 15112368
    [TBL] [Abstract][Full Text] [Related]  

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

  • 4. Restriction site mapping for three or more enzymes.
    Ho ST; Allison L; Yee CN
    Comput Appl Biosci; 1990 Jul; 6(3):195-204. PubMed ID: 2169968
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Computing atom mappings for biochemical reactions without subgraph isomorphism.
    Heinonen M; Lappalainen S; Mielikäinen T; Rousu J
    J Comput Biol; 2011 Jan; 18(1):43-58. PubMed ID: 21210731
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Error checking and graphical representation of multiple-complete-digest (MCD) restriction-fragment maps.
    Thayer EC; Olson MV; Karp RM
    Genome Res; 1999 Jan; 9(1):79-90. PubMed ID: 9927487
    [TBL] [Abstract][Full Text] [Related]  

  • 7. A New Augmentation Based Algorithm for Extracting Maximal Chordal Subgraphs.
    Bhowmick S; Chen TY; Halappanavar M
    J Parallel Distrib Comput; 2015 Feb; 76():132-144. PubMed ID: 25767331
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Algorithms for optical mapping.
    Karp RM; Shamir R
    J Comput Biol; 2000; 7(1-2):303-16. PubMed ID: 10890404
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Efficient extraction of mapping rules of atoms from enzymatic reaction data.
    Akutsu T
    J Comput Biol; 2004; 11(2-3):449-62. PubMed ID: 15285901
    [TBL] [Abstract][Full Text] [Related]  

  • 10. On the maximal interval subgraph of a tree.
    Zhang H; Zhou B
    J Comput Biol; 2010 Oct; 17(10):1425-33. PubMed ID: 20937015
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Heuristics for similarity searching of chemical graphs using a maximum common edge subgraph algorithm.
    Raymond JW; Gardiner EJ; Willett P
    J Chem Inf Comput Sci; 2002; 42(2):305-16. PubMed ID: 11911700
    [TBL] [Abstract][Full Text] [Related]  

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

  • 13. An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding.
    Guturu P; Dantu R
    IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):645-66. PubMed ID: 18558530
    [TBL] [Abstract][Full Text] [Related]  

  • 14. A constraint logic programming framework for constructing DNA restriction maps.
    Chuan RY
    Artif Intell Med; 1993 Oct; 5(5):447-64. PubMed ID: 8004144
    [TBL] [Abstract][Full Text] [Related]  

  • 15. An O (N2 log N) restriction map comparison and search algorithm.
    Myers EW; Huang X
    Bull Math Biol; 1992 Jul; 54(4):599-618. PubMed ID: 1591534
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Estimation of restriction maps with known site order using a generalized linear model.
    Waddington D; Burt DW
    Comput Appl Biosci; 1992 Dec; 8(6):539-48. PubMed ID: 1468009
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Four strikes against physical mapping of DNA.
    Goldberg PW; Golumbic MC; Kaplan H; Shamir R
    J Comput Biol; 1995; 2(1):139-52. PubMed ID: 7497116
    [TBL] [Abstract][Full Text] [Related]  

  • 18. An exponential example for a partial digest mapping algorithm.
    Zhang Z
    J Comput Biol; 1994; 1(3):235-9. PubMed ID: 8790468
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Fast molecular shape matching using contact maps.
    Agarwal PK; Mustafa NH; Wang Y
    J Comput Biol; 2007 Mar; 14(2):131-43. PubMed ID: 17456012
    [TBL] [Abstract][Full Text] [Related]  

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

    [Next]    [New Search]
    of 4.