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 *

199 related articles for article (PubMed ID: 19055792)

  • 1. A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions.
    Bader M; Abouelhoda MI; Ohlebusch E
    BMC Bioinformatics; 2008 Dec; 9():516. PubMed ID: 19055792
    [TBL] [Abstract][Full Text] [Related]  

  • 2. On the Complexity of Sorting by Reversals and Transpositions Problems.
    Oliveira AR; Brito KL; Dias U; Dias Z
    J Comput Biol; 2019 Nov; 26(11):1223-1229. PubMed ID: 31120331
    [No Abstract]   [Full Text] [Related]  

  • 3. Sorting by weighted reversals, transpositions, and inverted transpositions.
    Bader M; Ohlebusch E
    J Comput Biol; 2007 Jun; 14(5):615-36. PubMed ID: 17683264
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Phylogenetic reconstruction from transpositions.
    Yue F; Zhang M; Tang J
    BMC Genomics; 2008 Sep; 9 Suppl 2(Suppl 2):S15. PubMed ID: 18831780
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Assembling contigs in draft genomes using reversals and block-interchanges.
    Li CL; Chen KT; Lu CL
    BMC Bioinformatics; 2013; 14 Suppl 5(Suppl 5):S9. PubMed ID: 23734866
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Genome BLAST distance phylogenies inferred from whole plastid and whole mitochondrion genome sequences.
    Auch AF; Henz SR; Holland BR; Göker M
    BMC Bioinformatics; 2006 Jul; 7():350. PubMed ID: 16854218
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Genome Rearrangement Distance with Reversals, Transpositions, and Indels.
    Alexandrino AO; Oliveira AR; Dias U; Dias Z
    J Comput Biol; 2021 Mar; 28(3):235-247. PubMed ID: 33085536
    [TBL] [Abstract][Full Text] [Related]  

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

  • 9. A general heuristic for genome rearrangement problems.
    Dias U; Galvão GR; Lintzmayer CN; Dias Z
    J Bioinform Comput Biol; 2014 Jun; 12(3):1450012. PubMed ID: 24969750
    [TBL] [Abstract][Full Text] [Related]  

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

  • 11. Multi-break rearrangements and breakpoint re-uses: from circular to linear genomes.
    Alekseyev MA
    J Comput Biol; 2008 Oct; 15(8):1117-31. PubMed ID: 18788907
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Sorting permutations by fragmentation-weighted operations.
    Alexandrino AO; Lintzmayer CN; Dias Z
    J Bioinform Comput Biol; 2020 Apr; 18(2):2050006. PubMed ID: 32326802
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Genome-scale evolution: reconstructing gene orders in the ancestral species.
    Bourque G; Pevzner PA
    Genome Res; 2002 Jan; 12(1):26-36. PubMed ID: 11779828
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Reconstruction of ancestral genomic sequences using likelihood.
    Elias I; Tuller T
    J Comput Biol; 2007 Mar; 14(2):216-37. PubMed ID: 17456016
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Reversals and transpositions distance with proportion restriction.
    Brito KL; Alexandrino AO; Oliveira AR; Dias U; Dias Z
    J Bioinform Comput Biol; 2021 Aug; 19(4):2150013. PubMed ID: 34162319
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Heuristics for Genome Rearrangement Distance With Replicated Genes.
    Siqueira G; Brito KL; Dias U; Dias Z
    IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(6):2094-2108. PubMed ID: 34232886
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. Using median sets for inferring phylogenetic trees.
    Bernt M; Merkle D; Middendorf M
    Bioinformatics; 2007 Jan; 23(2):e129-35. PubMed ID: 17237080
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Rearrangement-based phylogeny using the Single-Cut-or-Join operation.
    Biller P; Feijão P; Meidanis J
    IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(1):122-34. PubMed ID: 23702549
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Sorting by Weighted Reversals and Transpositions.
    Rodrigues Oliveira A; Lima Brito K; Dias Z; Dias U
    J Comput Biol; 2019 May; 26(5):420-431. PubMed ID: 30785331
    [No Abstract]   [Full Text] [Related]  

    [Next]    [New Search]
    of 10.