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 *

157 related articles for article (PubMed ID: 34491104)

  • 21. Graph Traversal Edit Distance and Extensions.
    Ebrahimpour Boroojeny A; Shrestha A; Sharifi-Zarchi A; Gallagher SR; Sahinalp SC; Chitsaz H
    J Comput Biol; 2020 Mar; 27(3):317-329. PubMed ID: 32058803
    [No 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. The Multi-State Perfect Phylogeny Problem with missing and removable data: solutions via integer-programming and chordal graph theory.
    Gusfield D
    J Comput Biol; 2010 Mar; 17(3):383-99. PubMed ID: 20377452
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Computing Manhattan Path-Difference Median Trees: A Practical Local Search Approach.
    Markin A; Eulenstein O
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(4):1063-1076. PubMed ID: 28650824
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Computing the minimum recombinant haplotype configuration from incomplete genotype data on a pedigree by integer linear programming.
    Li J; Jiang T
    J Comput Biol; 2005; 12(6):719-39. PubMed ID: 16108713
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Generalized buneman pruning for inferring the most parsimonious multi-state phylogeny.
    Misra N; Blelloch G; Ravi R; Schwartz R
    J Comput Biol; 2011 Mar; 18(3):445-57. PubMed ID: 21385046
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Merging Partially Labelled Trees: Hardness and a Declarative Programming Solution.
    Labarre A; Verwer S
    IEEE/ACM Trans Comput Biol Bioinform; 2014; 11(2):389-97. PubMed ID: 26355785
    [TBL] [Abstract][Full Text] [Related]  

  • 28. A Novel Method for Inferring Chemical Compounds With Prescribed Topological Substructures Based on Integer Programming.
    Zhu J; Azam NA; Zhang F; Shurbevski A; Haraguchi K; Zhao L; Nagamochi H; Akutsu T
    IEEE/ACM Trans Comput Biol Bioinform; 2022; 19(6):3233-3245. PubMed ID: 34520360
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Calculation of evolutionary correlation between individual genes and full-length genome: a method useful for choosing phylogenetic markers for molecular epidemiology.
    Wang S; Luo X; Wei W; Zheng Y; Dou Y; Cai X
    PLoS One; 2013; 8(12):e81106. PubMed ID: 24312527
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Discovery of Boolean metabolic networks: integer linear programming based approach.
    Qiu Y; Jiang H; Ching WK; Cheng X
    BMC Syst Biol; 2018 Apr; 12(Suppl 1):7. PubMed ID: 29671395
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Connectivity problems on heterogeneous graphs.
    Wu J; Khodaverdian A; Weitz B; Yosef N
    Algorithms Mol Biol; 2019; 14():5. PubMed ID: 30899321
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Mixed integer linear programming for maximum-parsimony phylogeny inference.
    Sridhar S; Lam F; Blelloch GE; Ravi R; Schwartz R
    IEEE/ACM Trans Comput Biol Bioinform; 2008; 5(3):323-31. PubMed ID: 18670037
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Revisiting the complexity of and algorithms for the graph traversal edit distance and its variants.
    Qiu Y; Shen Y; Kingsford C
    Algorithms Mol Biol; 2024 Apr; 19(1):17. PubMed ID: 38679703
    [TBL] [Abstract][Full Text] [Related]  

  • 34. A divide and conquer approach for construction of large-scale signaling networks from PPI and RNAi data using linear programming.
    Ozsoy OE; Can T
    IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(4):869-83. PubMed ID: 24334382
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Reconstructing a SuperGeneTree minimizing reconciliation.
    Lafond M; Ouangraoua A; El-Mabrouk N
    BMC Bioinformatics; 2015; 16 Suppl 14(Suppl 14):S4. PubMed ID: 26451911
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Synthesizing large-scale species trees using the strict consensus approach.
    Moon J; Eulenstein O
    J Bioinform Comput Biol; 2017 Jun; 15(3):1740002. PubMed ID: 28513253
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Efficient Local Search for Euclidean Path-Difference Median Trees.
    Markin A; Eulenstein O
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(4):1374-1385. PubMed ID: 29035224
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Enforcing Temporal Consistency in Migration History Inference.
    Roddur MS; Snir S; El-Kebir M
    J Comput Biol; 2024 May; 31(5):396-415. PubMed ID: 38754138
    [No Abstract]   [Full Text] [Related]  

  • 39. Maximum Stacking Base Pairs: Hardness and Approximation by Nonlinear Linear Programming-Rounding.
    Liu L; Jiang H; Liu P; Zhu B; Zhu D
    J Comput Biol; 2020 Feb; 27(2):200-211. PubMed ID: 31905005
    [No Abstract]   [Full Text] [Related]  

  • 40. Integer programming-based method for grammar-based tree compression and its application to pattern extraction of glycan tree structures.
    Zhao Y; Hayashida M; Akutsu T
    BMC Bioinformatics; 2010 Dec; 11 Suppl 11(Suppl 11):S4. PubMed ID: 21172054
    [TBL] [Abstract][Full Text] [Related]  

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