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 *

132 related articles for article (PubMed ID: 24407297)

  • 21. Perfect sorting by reversals is not always difficult.
    Bérard S; Bergeron A; Chauve C; Paul C
    IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(1):4-16. PubMed ID: 17277409
    [TBL] [Abstract][Full Text] [Related]  

  • 22. String correction using the Damerau-Levenshtein distance.
    Zhao C; Sahni S
    BMC Bioinformatics; 2019 Jun; 20(Suppl 11):277. PubMed ID: 31167641
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

  • 27. An efficient rank based approach for closest string and closest substring.
    Dinu LP; Ionescu R
    PLoS One; 2012; 7(6):e37576. PubMed ID: 22675483
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Error Tree: A Tree Structure for Hamming and Edit Distances and Wildcards Matching.
    Al-Okaily A
    J Comput Biol; 2015 Dec; 22(12):1118-28. PubMed ID: 26402070
    [TBL] [Abstract][Full Text] [Related]  

  • 29. MSOAR: a high-throughput ortholog assignment system based on genome rearrangement.
    Fu Z; Chen X; Vacic V; Nan P; Zhong Y; Jiang T
    J Comput Biol; 2007 Nov; 14(9):1160-75. PubMed ID: 17990975
    [TBL] [Abstract][Full Text] [Related]  

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

  • 31. Divide-and-conquer approach for the exemplar breakpoint distance.
    Nguyen CT; Tay YC; Zhang L
    Bioinformatics; 2005 May; 21(10):2171-6. PubMed ID: 15713729
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Extending the algebraic formalism for genome rearrangements to include linear chromosomes.
    Feijão P; Meidanis J
    IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(4):819-31. PubMed ID: 24334378
    [TBL] [Abstract][Full Text] [Related]  

  • 33. SynPAM-a distance measure based on synonymous codon substitutions.
    Schneider A; Gonnet G; Cannarozzi G
    IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(4):553-60. PubMed ID: 17975267
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Reconstructing ancestral genomic sequences by co-evolution: formal definitions, computational issues, and biological examples.
    Tuller T; Birin H; Kupiec M; Ruppin E
    J Comput Biol; 2010 Sep; 17(9):1327-44. PubMed ID: 20874411
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Scoredist: a simple and robust protein sequence distance estimator.
    Sonnhammer EL; Hollich V
    BMC Bioinformatics; 2005 Apr; 6():108. PubMed ID: 15857510
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Evolutionary distance estimation and fidelity of pair wise sequence alignment.
    Rosenberg MS
    BMC Bioinformatics; 2005 Apr; 6():102. PubMed ID: 15840174
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Optimizing phylogenetic networks for circular split systems.
    Phipps P; Bereg S
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(2):535-47. PubMed ID: 21788677
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Genome phylogenetic analysis based on extended gene contents.
    Gu X; Zhang H
    Mol Biol Evol; 2004 Jul; 21(7):1401-8. PubMed ID: 15084675
    [TBL] [Abstract][Full Text] [Related]  

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

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

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