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 *

129 related articles for article (PubMed ID: 27924003)

  • 41. An efficient algorithm for DNA fragment assembly in MapReduce.
    Xu B; Gao J; Li C
    Biochem Biophys Res Commun; 2012 Sep; 426(3):395-8. PubMed ID: 22960169
    [TBL] [Abstract][Full Text] [Related]  

  • 42. A novel codon-based de Bruijn graph algorithm for gene construction from unassembled transcriptomes.
    Peng G; Ji P; Zhao F
    Genome Biol; 2016 Nov; 17(1):232. PubMed ID: 27855707
    [TBL] [Abstract][Full Text] [Related]  

  • 43. BrownieAligner: accurate alignment of Illumina sequencing data to de Bruijn graphs.
    Heydari M; Miclotte G; Van de Peer Y; Fostier J
    BMC Bioinformatics; 2018 Sep; 19(1):311. PubMed ID: 30180801
    [TBL] [Abstract][Full Text] [Related]  

  • 44. A tri-tuple coordinate system derived for fast and accurate analysis of the colored de Bruijn graph-based pangenomes.
    Guo J; Pang E; Song H; Lin K
    BMC Bioinformatics; 2021 May; 22(1):282. PubMed ID: 34044757
    [TBL] [Abstract][Full Text] [Related]  

  • 45. AN EFFICIENT ALGORITHM FOR CHINESE POSTMAN WALK ON BI-DIRECTED DE BRUIJN GRAPHS.
    Kundeti V; Rajasekaran S; Dinh H
    Discrete Math Algorithms Appl; 2010; 1():184-196. PubMed ID: 25364472
    [TBL] [Abstract][Full Text] [Related]  

  • 46. Hybrid assembly of the large and highly repetitive genome of
    Zimin AV; Puiu D; Luo MC; Zhu T; Koren S; Marçais G; Yorke JA; Dvořák J; Salzberg SL
    Genome Res; 2017 May; 27(5):787-792. PubMed ID: 28130360
    [TBL] [Abstract][Full Text] [Related]  

  • 47. BASE: a practical de novo assembler for large genomes using long NGS reads.
    Liu B; Liu CM; Li D; Li Y; Ting HF; Yiu SM; Luo R; Lam TW
    BMC Genomics; 2016 Aug; 17 Suppl 5(Suppl 5):499. PubMed ID: 27586129
    [TBL] [Abstract][Full Text] [Related]  

  • 48. How to apply de Bruijn graphs to genome assembly.
    Compeau PE; Pevzner PA; Tesler G
    Nat Biotechnol; 2011 Nov; 29(11):987-91. PubMed ID: 22068540
    [No Abstract]   [Full Text] [Related]  

  • 49. Maximum likelihood genome assembly.
    Medvedev P; Brudno M
    J Comput Biol; 2009 Aug; 16(8):1101-16. PubMed ID: 19645596
    [TBL] [Abstract][Full Text] [Related]  

  • 50. ELOPER: elongation of paired-end reads as a pre-processing tool for improved de novo genome assembly.
    Silver DH; Ben-Elazar S; Bogoslavsky A; Yanai I
    Bioinformatics; 2013 Jun; 29(11):1455-7. PubMed ID: 23603334
    [TBL] [Abstract][Full Text] [Related]  

  • 51. Heterozygous genome assembly via binary classification of homologous sequence.
    Bodily PM; Fujimoto M; Ortega C; Okuda N; Price JC; Clement MJ; Snell Q
    BMC Bioinformatics; 2015; 16 Suppl 7(Suppl 7):S5. PubMed ID: 25952609
    [TBL] [Abstract][Full Text] [Related]  

  • 52. SplitMEM: a graphical algorithm for pan-genome analysis with suffix skips.
    Marcus S; Lee H; Schatz MC
    Bioinformatics; 2014 Dec; 30(24):3476-83. PubMed ID: 25398610
    [TBL] [Abstract][Full Text] [Related]  

  • 53. CSAR: a contig scaffolding tool using algebraic rearrangements.
    Chen KT; Liu CL; Huang SH; Shen HT; Shieh YK; Chiu HT; Lu CL
    Bioinformatics; 2018 Jan; 34(1):109-111. PubMed ID: 28968788
    [TBL] [Abstract][Full Text] [Related]  

  • 54. FinisherSC: a repeat-aware tool for upgrading de novo assembly using long reads.
    Lam KK; LaButti K; Khalak A; Tse D
    Bioinformatics; 2015 Oct; 31(19):3207-9. PubMed ID: 26040454
    [TBL] [Abstract][Full Text] [Related]  

  • 55. Faucet: streaming de novo assembly graph construction.
    Rozov R; Goldshlager G; Halperin E; Shamir R
    Bioinformatics; 2018 Jan; 34(1):147-154. PubMed ID: 29036597
    [TBL] [Abstract][Full Text] [Related]  

  • 56. NeatFreq: reference-free data reduction and coverage normalization for De Novo sequence assembly.
    McCorrison JM; Venepally P; Singh I; Fouts DE; Lasken RS; Methé BA
    BMC Bioinformatics; 2014 Nov; 15(1):357. PubMed ID: 25407910
    [TBL] [Abstract][Full Text] [Related]  

  • 57. GRASS: a generic algorithm for scaffolding next-generation sequencing assemblies.
    Gritsenko AA; Nijkamp JF; Reinders MJ; de Ridder D
    Bioinformatics; 2012 Jun; 28(11):1429-37. PubMed ID: 22492642
    [TBL] [Abstract][Full Text] [Related]  

  • 58. De novo detection of copy number variation by co-assembly.
    Nijkamp JF; van den Broek MA; Geertman JM; Reinders MJ; Daran JM; de Ridder D
    Bioinformatics; 2012 Dec; 28(24):3195-202. PubMed ID: 23047563
    [TBL] [Abstract][Full Text] [Related]  

  • 59. ScaffMatch: scaffolding algorithm based on maximum weight matching.
    Mandric I; Zelikovsky A
    Bioinformatics; 2015 Aug; 31(16):2632-8. PubMed ID: 25890305
    [TBL] [Abstract][Full Text] [Related]  

  • 60. SCARPA: scaffolding reads with practical algorithms.
    Donmez N; Brudno M
    Bioinformatics; 2013 Feb; 29(4):428-34. PubMed ID: 23274213
    [TBL] [Abstract][Full Text] [Related]  

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