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 *

100 related articles for article (PubMed ID: 17369634)

  • 21. A Linear-Time Algorithm for the Copy Number Transformation Problem.
    Zeira R; Zehavi M; Shamir R
    J Comput Biol; 2017 Dec; 24(12):1179-1194. PubMed ID: 28837352
    [TBL] [Abstract][Full Text] [Related]  

  • 22. An algorithm to enumerate sorting reversals for signed permutations.
    Siepel AC
    J Comput Biol; 2003; 10(3-4):575-97. PubMed ID: 12935346
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Restricted DCJ-indel model: sorting linear genomes with DCJ and indels.
    da Silva PH; Machado R; Dantas S; Braga MD
    BMC Bioinformatics; 2012; 13 Suppl 19(Suppl 19):S14. PubMed ID: 23281630
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Efficient sorting of genomic permutations by translocation, inversion and block interchange.
    Yancopoulos S; Attie O; Friedberg R
    Bioinformatics; 2005 Aug; 21(16):3340-6. PubMed ID: 15951307
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Comparing genomes with duplications: a computational complexity point of view.
    Blin G; Chauve C; Fertin G; Rizzi R; Vialette S
    IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(4):523-34. PubMed ID: 17975264
    [TBL] [Abstract][Full Text] [Related]  

  • 26. On the structure of syntenic distance.
    Liben-Nowell D
    J Comput Biol; 2001; 8(1):53-67. PubMed ID: 11339906
    [TBL] [Abstract][Full Text] [Related]  

  • 27. The zero exemplar distance problem.
    Jiang M
    J Comput Biol; 2011 Sep; 18(9):1077-86. PubMed ID: 21899417
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Double cut and join with insertions and deletions.
    Braga MD; Willing E; Stoye J
    J Comput Biol; 2011 Sep; 18(9):1167-84. PubMed ID: 21899423
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Analysis of circular genome rearrangement by fusions, fissions and block-interchanges.
    Lu CL; Huang YL; Wang TC; Chiu HT
    BMC Bioinformatics; 2006 Jun; 7():295. PubMed ID: 16768797
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Restricted DCJ model: rearrangement problems with chromosome reincorporation.
    Kováč J; Warren R; Braga MD; Stoye J
    J Comput Biol; 2011 Sep; 18(9):1231-41. PubMed ID: 21899428
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Computing the reversal distance between genomes in the presence of multi-gene families via binary integer programming.
    Suksawatchon J; Lursinsap C; Bodén M
    J Bioinform Comput Biol; 2007 Feb; 5(1):117-33. PubMed ID: 17477494
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Sorting by short swaps.
    Heath LS; Vergara JP
    J Comput Biol; 2003; 10(5):775-89. PubMed ID: 14633399
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Reversal distance for partially ordered genomes.
    Zheng C; Lenert A; Sankoff D
    Bioinformatics; 2005 Jun; 21 Suppl 1():i502-8. PubMed ID: 15961497
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Intergenomic translocations in unisexual salamanders of the genus Ambystoma (Amphibia, Caudata).
    Bi K; Bogart JP; Fu J
    Cytogenet Genome Res; 2007; 116(4):289-97. PubMed ID: 17431327
    [TBL] [Abstract][Full Text] [Related]  

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

  • 36. Assignment of orthologous genes via genome rearrangement.
    Chen X; Zheng J; Fu Z; Nan P; Zhong Y; Lonardi S; Jiang T
    IEEE/ACM Trans Comput Biol Bioinform; 2005; 2(4):302-15. PubMed ID: 17044168
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Sorting cancer karyotypes by elementary operations.
    Ozery-Flato M; Shamir R
    J Comput Biol; 2009 Oct; 16(10):1445-60. PubMed ID: 19754273
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Hurdles and sorting by inversions: combinatorial, statistical, and experimental results.
    Swenson KM; Lin Y; Rajan V; Moret BM
    J Comput Biol; 2009 Oct; 16(10):1339-51. PubMed ID: 19747037
    [TBL] [Abstract][Full Text] [Related]  

  • 39. A Flow Procedure for Linearization of Genome Sequence Graphs.
    Haussler D; Smuga-Otto M; Eizenga JM; Paten B; Novak AM; Nikitin S; Zueva M; Miagkov D
    J Comput Biol; 2018 Jul; 25(7):664-676. PubMed ID: 29792514
    [TBL] [Abstract][Full Text] [Related]  

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

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