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 *

91 related articles for article (PubMed ID: 24334385)

  • 1. An improved approximation algorithm for scaffold filling to maximize the common adjacencies.
    Liu N; Jiang H; Zhu D; Zhu B
    IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(4):905-13. PubMed ID: 24334385
    [TBL] [Abstract][Full Text] [Related]  

  • 2. A 2-approximation algorithm for the contig-based genomic scaffold filling problem.
    Jiang H; Qingge L; Zhu D; Zhu B
    J Bioinform Comput Biol; 2018 Dec; 16(6):1850022. PubMed ID: 30616473
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Scaffold filling under the breakpoint and related distances.
    Jiang H; Zheng C; Sankoff D; Zhu B
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(4):1220-9. PubMed ID: 22529329
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Algorithms and Hardness for Scaffold Filling to Maximize Increased Duo-Preservations.
    Ma J; Jiang H; Zhu D; Yang R
    IEEE/ACM Trans Comput Biol Bioinform; 2022; 19(4):2071-2079. PubMed ID: 34038366
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Approaching the One-Sided Exemplar Adjacency Number Problem.
    Qingge L; Smith K; Jungst S; Wang B; Yang Q; Zhu B
    IEEE/ACM Trans Comput Biol Bioinform; 2020; 17(6):1946-1954. PubMed ID: 31056506
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Filling a Protein Scaffold With a Reference.
    Qingge L; Liu X; Zhong F; Zhu B
    IEEE Trans Nanobioscience; 2017 Mar; 16(2):123-130. PubMed ID: 28207401
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Algorithms and Complexity Results for Genome Mapping Problems.
    Rajaraman A; Zanetti JP; Manuch J; Chauve C
    IEEE/ACM Trans Comput Biol Bioinform; 2017; 14(2):418-430. PubMed ID: 26887011
    [TBL] [Abstract][Full Text] [Related]  

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

  • 9. An approximation algorithm for the minimum breakpoint linearization problem.
    Chen X; Cui Y
    IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(3):401-9. PubMed ID: 19644168
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Multiple sequence assembly from reads alignable to a common reference genome.
    Peng Q; Smith AD
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1283-95. PubMed ID: 21778524
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Efficient tools for computing the number of breakpoints and the number of adjacencies between two genomes with duplicate genes.
    Angibaud S; Fertin G; Rusu I; Thévenin A; Vialette S
    J Comput Biol; 2008 Oct; 15(8):1093-115. PubMed ID: 18774903
    [TBL] [Abstract][Full Text] [Related]  

  • 12. On Computing Breakpoint Distances for Genomes with Duplicate Genes.
    Shao M; Moret BME
    J Comput Biol; 2017 Jun; 24(6):571-580. PubMed ID: 27788022
    [TBL] [Abstract][Full Text] [Related]  

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

  • 14. Gene maps linearization using genomic rearrangement distances.
    Blin G; Blais E; Hermelin D; Guillon P; Blanchette M; El-Mabrouk N
    J Comput Biol; 2007 May; 14(4):394-407. PubMed ID: 17572019
    [TBL] [Abstract][Full Text] [Related]  

  • 15. A 1.375-approximation algorithm for sorting by transpositions.
    Elias I; Hartman T
    IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(4):369-79. PubMed ID: 17085846
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. Whole genome assembly from 454 sequencing output via modified DNA graph concept.
    Blazewicz J; Bryja M; Figlerowicz M; Gawron P; Kasprzak M; Kirton E; Platt D; Przybytek J; Swiercz A; Szajkowski L
    Comput Biol Chem; 2009 Jun; 33(3):224-30. PubMed ID: 19477687
    [TBL] [Abstract][Full Text] [Related]  

  • 18. A 2-Approximation Scheme for Sorting Signed Permutations by Reversals, Transpositions, Transreversals, and Block-Interchanges.
    Hao F; Zhang M; Leong HW
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(5):1702-1711. PubMed ID: 28678711
    [TBL] [Abstract][Full Text] [Related]  

  • 19. An O(m log m)-Time Algorithm for Detecting Superbubbles.
    Sung WK; Sadakane K; Shibuya T; Belorkar A; Pyrogova I
    IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(4):770-7. PubMed ID: 26357315
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Parallel approach on sorting of genes in search of optimal solution.
    Kumar P; Sahoo G
    Genomics; 2018 May; 110(3):149-153. PubMed ID: 28917636
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 5.