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 *

128 related articles for article (PubMed ID: 38178195)

  • 21. Moments of genome evolution by Double Cut-and-Join.
    Biller P; Guéguen L; Tannier E
    BMC Bioinformatics; 2015; 16 Suppl 14(Suppl 14):S7. PubMed ID: 26451469
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Sorting Linear Genomes with Rearrangements and Indels.
    Braga MD; Stoye J
    IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(3):500-6. PubMed ID: 26357261
    [TBL] [Abstract][Full Text] [Related]  

  • 23. DCJ path formulation for genome transformations which include insertions, deletions, and duplications.
    Yancopoulos S; Friedberg R
    J Comput Biol; 2009 Oct; 16(10):1311-38. PubMed ID: 19803734
    [TBL] [Abstract][Full Text] [Related]  

  • 24. A new 1.375-approximation algorithm for sorting by transpositions.
    Silva LAG; Kowada LAB; Rocco NR; Walter MEMT
    Algorithms Mol Biol; 2022 Jan; 17(1):1. PubMed ID: 35033127
    [TBL] [Abstract][Full Text] [Related]  

  • 25. A general framework for genome rearrangement with biological constraints.
    Simonaitis P; Chateau A; Swenson KM
    Algorithms Mol Biol; 2019; 14():15. PubMed ID: 31360217
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Computation of perfect DCJ rearrangement scenarios with linear and circular chromosomes.
    Bérard S; Chateau A; Chauve C; Paul C; Tannier E
    J Comput Biol; 2009 Oct; 16(10):1287-309. PubMed ID: 19803733
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Sorting by Cuts, Joins, and Whole Chromosome Duplications.
    Zeira R; Shamir R
    J Comput Biol; 2017 Feb; 24(2):127-137. PubMed ID: 27704866
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Escape from Parsimony of a Double-Cut-and-Join Genome Evolution Process.
    Miardan MM; Jamshidpey A; Sankoff D
    J Comput Biol; 2023 Feb; 30(2):118-130. PubMed ID: 36595359
    [TBL] [Abstract][Full Text] [Related]  

  • 29. ET-Motif: Solving the Exact (l, d)-Planted Motif Problem Using Error Tree Structure.
    Al-Okaily A; Huang CH
    J Comput Biol; 2016 Jul; 23(7):615-23. PubMed ID: 27152692
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Extremal values on Zagreb indices of trees with given distance
    Pei L; Pan X
    J Inequal Appl; 2018; 2018(1):16. PubMed ID: 29375233
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Algorithms for computing the double cut and join distance on both gene order and intergenic sizes.
    Fertin G; Jean G; Tannier E
    Algorithms Mol Biol; 2017; 12():16. PubMed ID: 28592988
    [TBL] [Abstract][Full Text] [Related]  

  • 32. On the complexity of rearrangement problems under the breakpoint distance.
    Kováč J
    J Comput Biol; 2014 Jan; 21(1):1-15. PubMed ID: 24200391
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Distribution and asymptotic behavior of the phylogenetic transfer distance.
    Dávila Felipe M; Domelevo Entfellner JB; Lemoine F; Truszkowski J; Gascuel O
    J Math Biol; 2019 Jul; 79(2):485-508. PubMed ID: 31037350
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Computing the Inversion-Indel Distance.
    Willing E; Stoye J; Braga MDV
    IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(6):2314-2326. PubMed ID: 32324562
    [TBL] [Abstract][Full Text] [Related]  

  • 35. An O([Formula: see text]) algorithm for sorting signed genomes by reversals, transpositions, transreversals and block-interchanges.
    Yu S; Hao F; Leong HW
    J Bioinform Comput Biol; 2016 Feb; 14(1):1640002. PubMed ID: 26707923
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Remoteness and distance, distance (signless) Laplacian eigenvalues of a graph.
    Jia H; Song H
    J Inequal Appl; 2018; 2018(1):69. PubMed ID: 29628745
    [TBL] [Abstract][Full Text] [Related]  

  • 37. On the inversion-indel distance.
    Willing E; Zaccaria S; Braga MD; Stoye J
    BMC Bioinformatics; 2013; 14 Suppl 15(Suppl 15):S3. PubMed ID: 24564182
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Genome dedoubling by DCJ and reversal.
    Thomas A; Varré JS; Ouangraoua A
    BMC Bioinformatics; 2011 Oct; 12 Suppl 9(Suppl 9):S20. PubMed ID: 22152053
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Approximate search for known gene clusters in new genomes using PQ-trees.
    Zimerman GR; Svetlitsky D; Zehavi M; Ziv-Ukelson M
    Algorithms Mol Biol; 2021 Jul; 16(1):16. PubMed ID: 34243815
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Reconstructing One-Articulated Networks with Distance Matrices.
    Chang KY; Cui Y; Yiu SM; Hon WK
    J Comput Biol; 2018 Mar; 25(3):253-269. PubMed ID: 29028179
    [TBL] [Abstract][Full Text] [Related]  

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