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)

  • 1. Investigating the complexity of the double distance problems.
    Braga MDV; Brockmann LR; Klerx K; Stoye J
    Algorithms Mol Biol; 2024 Jan; 19(1):1. PubMed ID: 38178195
    [TBL] [Abstract][Full Text] [Related]  

  • 2. On the rank-distance median of 3 permutations.
    Chindelevitch L; Pereira Zanetti JP; Meidanis J
    BMC Bioinformatics; 2018 May; 19(Suppl 6):142. PubMed ID: 29745865
    [TBL] [Abstract][Full Text] [Related]  

  • 3. New algorithms for structure informed genome rearrangement.
    Ozeri E; Zehavi M; Ziv-Ukelson M
    Algorithms Mol Biol; 2023 Dec; 18(1):17. PubMed ID: 38037088
    [TBL] [Abstract][Full Text] [Related]  

  • 4. SCJ: a breakpoint-like distance that simplifies several rearrangement problems.
    Feijão P; Meidanis J
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1318-29. PubMed ID: 21339538
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Approximating the DCJ distance of balanced genomes in linear time.
    Rubert DP; Feijão P; Braga MDV; Stoye J; Martinez FHV
    Algorithms Mol Biol; 2017; 12():3. PubMed ID: 28293275
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Efficient gene orthology inference via large-scale rearrangements.
    Rubert DP; Braga MDV
    Algorithms Mol Biol; 2023 Sep; 18(1):14. PubMed ID: 37770945
    [TBL] [Abstract][Full Text] [Related]  

  • 7. The median problems on linear multichromosomal genomes: graph representation and fast exact solutions.
    Xu AW
    J Comput Biol; 2010 Sep; 17(9):1195-211. PubMed ID: 20874404
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Multichromosomal median and halving problems under different genomic distances.
    Tannier E; Zheng C; Sankoff D
    BMC Bioinformatics; 2009 Apr; 10():120. PubMed ID: 19386099
    [TBL] [Abstract][Full Text] [Related]  

  • 9. On the family-free DCJ distance and similarity.
    Martinez FV; Feijão P; Braga MD; Stoye J
    Algorithms Mol Biol; 2015; 10():13. PubMed ID: 25859276
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Algorithms for sorting unsigned linear genomes by the DCJ operations.
    Jiang H; Zhu B; Zhu D
    Bioinformatics; 2011 Feb; 27(3):311-6. PubMed ID: 21134895
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Fast ancestral gene order reconstruction of genomes with unequal gene content.
    Feijão P; Araujo E
    BMC Bioinformatics; 2016 Nov; 17(Suppl 14):413. PubMed ID: 28185578
    [TBL] [Abstract][Full Text] [Related]  

  • 12. On pairwise distances and median score of three genomes under DCJ.
    Aganezov S; Alekseyev MA
    BMC Bioinformatics; 2012; 13 Suppl 19(Suppl 19):S1. PubMed ID: 23282410
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Recombinations, chains and caps: resolving problems with the DCJ-indel model.
    Bohnenkämper L
    Algorithms Mol Biol; 2024 Feb; 19(1):8. PubMed ID: 38414060
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Generalized Hultman Numbers and Cycle Structures of Breakpoint Graphs.
    Alexeev N; Pologova A; Alekseyev MA
    J Comput Biol; 2017 Feb; 24(2):93-105. PubMed ID: 28045556
    [TBL] [Abstract][Full Text] [Related]  

  • 15. On the distribution of cycles and paths in multichromosomal breakpoint graphs and the expected value of rearrangement distance.
    Feijão P; Martinez F; Thévenin A
    BMC Bioinformatics; 2015; 16 Suppl 19(Suppl 19):S1. PubMed ID: 26695008
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Computing the Rearrangement Distance of Natural Genomes.
    Bohnenkämper L; Braga MDV; Doerr D; Stoye J
    J Comput Biol; 2021 Apr; 28(4):410-431. PubMed ID: 33393848
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. Natural family-free genomic distance.
    Rubert DP; Martinez FV; Braga MDV
    Algorithms Mol Biol; 2021 May; 16(1):4. PubMed ID: 33971908
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Approximating the double-cut-and-join distance between unsigned genomes.
    Chen X; Sun R; Yu J
    BMC Bioinformatics; 2011 Oct; 12 Suppl 9(Suppl 9):S17. PubMed ID: 22151948
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Labeled Cycle Graph for Transposition and Indel Distance.
    Alexandrino AO; Oliveira AR; Dias U; Dias Z
    J Comput Biol; 2022 Mar; 29(3):243-256. PubMed ID: 34724796
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.