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 *

149 related articles for article (PubMed ID: 35044918)

  • 21. Accurate construction of consensus genetic maps via integer linear programming.
    Wu Y; Close TJ; Lonardi S
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(2):381-94. PubMed ID: 20479505
    [TBL] [Abstract][Full Text] [Related]  

  • 22. An Exact Algorithm to Compute the Double-Cut-and-Join Distance for Genomes with Duplicate Genes.
    Shao M; Lin Y; Moret BM
    J Comput Biol; 2015 May; 22(5):425-35. PubMed ID: 25517208
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Efficient Minimum Flow Decomposition via Integer Linear Programming.
    Dias FHC; Williams L; Mumey B; Tomescu AI
    J Comput Biol; 2022 Nov; 29(11):1252-1267. PubMed ID: 36260412
    [TBL] [Abstract][Full Text] [Related]  

  • 24. The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations.
    Hellmuth M; Stadler PF; Wieseke N
    J Math Biol; 2017 Jul; 75(1):199-237. PubMed ID: 27904954
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Overlapping communities detection through weighted graph community games.
    Benati S; Puerto J; Rodríguez-Chía AM; Temprano F
    PLoS One; 2023; 18(4):e0283857. PubMed ID: 37014883
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Approaching the One-Sided Exemplar Adjacency Number Problem.
    Qingge L; Smith K; Jungst S; Wang B; Yang Q; Zhu B
    IEEE/ACM Trans Comput Biol Bioinform; 2020; 17(6):1946-1954. PubMed ID: 31056506
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Vertex Deletion into Bipartite Permutation Graphs.
    Bożyk Ł; Derbisz J; Krawczyk T; Novotná J; Okrasa K
    Algorithmica; 2022; 84(8):2271-2291. PubMed ID: 35880199
    [TBL] [Abstract][Full Text] [Related]  

  • 28. On the inference of parsimonious indel evolutionary scenarios.
    Chindelevitch L; Li Z; Blais E; Blanchette M
    J Bioinform Comput Biol; 2006 Jun; 4(3):721-44. PubMed ID: 16960972
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees.
    Baste J; Paul C; Sau I; Scornavacca C
    Bull Math Biol; 2017 Apr; 79(4):920-938. PubMed ID: 28247121
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Approximating the correction of weighted and unweighted orthology and paralogy relations.
    Dondi R; Lafond M; El-Mabrouk N
    Algorithms Mol Biol; 2017; 12():4. PubMed ID: 28293276
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Orthology relations, symbolic ultrametrics, and cographs.
    Hellmuth M; Hernandez-Rosales M; Huber KT; Moulton V; Stadler PF; Wieseke N
    J Math Biol; 2013 Jan; 66(1-2):399-420. PubMed ID: 22456957
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Leaf-to-leaf distances and their moments in finite and infinite ordered m-ary tree graphs.
    Goldsborough AM; Rautu SA; Römer RA
    Phys Rev E Stat Nonlin Soft Matter Phys; 2015 Apr; 91(4):042133. PubMed ID: 25974464
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Tree-based networks: characterisations, metrics, and support trees.
    Pons JC; Semple C; Steel M
    J Math Biol; 2019 Mar; 78(4):899-918. PubMed ID: 30283985
    [TBL] [Abstract][Full Text] [Related]  

  • 34. A linear programming approach to max-sum problem: a review.
    Werner T
    IEEE Trans Pattern Anal Mach Intell; 2007 Jul; 29(7):1165-79. PubMed ID: 17496375
    [TBL] [Abstract][Full Text] [Related]  

  • 35. A memory-efficient data structure representing exact-match overlap graphs with application for next-generation DNA assembly.
    Dinh H; Rajasekaran S
    Bioinformatics; 2011 Jul; 27(14):1901-7. PubMed ID: 21636593
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Analyzing and synthesizing phylogenies using tree alignment graphs.
    Smith SA; Brown JW; Hinchliff CE
    PLoS Comput Biol; 2013; 9(9):e1003223. PubMed ID: 24086118
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Biologically feasible gene trees, reconciliation maps and informative triples.
    Hellmuth M
    Algorithms Mol Biol; 2017; 12():23. PubMed ID: 28861118
    [TBL] [Abstract][Full Text] [Related]  

  • 38. MultiTrans: An Algorithm for Path Extraction Through Mixed Integer Linear Programming for Transcriptome Assembly.
    Zhao J; Feng H; Zhu D; Lin Y
    IEEE/ACM Trans Comput Biol Bioinform; 2022; 19(1):48-56. PubMed ID: 34033544
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Algorithms for MDC-based multi-locus phylogeny inference: beyond rooted binary gene trees on single alleles.
    Yu Y; Warnow T; Nakhleh L
    J Comput Biol; 2011 Nov; 18(11):1543-59. PubMed ID: 22035329
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Analyzing Phylogenetic Trees with a Tree Lattice Coordinate System and a Graph Polynomial.
    Liu P; Biller P; Gould M; Colijn C
    Syst Biol; 2022 Oct; 71(6):1378-1390. PubMed ID: 35169849
    [TBL] [Abstract][Full Text] [Related]  

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