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 *

88 related articles for article (PubMed ID: 34014915)

  • 1. What do Eulerian and Hamiltonian cycles have to do with genome assembly?
    Medvedev P; Pop M
    PLoS Comput Biol; 2021 May; 17(5):e1008928. PubMed ID: 34014915
    [TBL] [Abstract][Full Text] [Related]  

  • 2. The present and future of de novo whole-genome assembly.
    Sohn JI; Nam JW
    Brief Bioinform; 2018 Jan; 19(1):23-40. PubMed ID: 27742661
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Read mapping on de Bruijn graphs.
    Limasset A; Cazaux B; Rivals E; Peterlongo P
    BMC Bioinformatics; 2016 Jun; 17(1):237. PubMed ID: 27306641
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Information-optimal genome assembly via sparse read-overlap graphs.
    Shomorony I; Kim SH; Courtade TA; Tse DN
    Bioinformatics; 2016 Sep; 32(17):i494-i502. PubMed ID: 27587667
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Do it yourself guide to genome assembly.
    Wajid B; Serpedin E
    Brief Funct Genomics; 2016 Jan; 15(1):1-9. PubMed ID: 25392234
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Aligning optical maps to de Bruijn graphs.
    Mukherjee K; Alipanahi B; Kahveci T; Salmela L; Boucher C
    Bioinformatics; 2019 Sep; 35(18):3250-3256. PubMed ID: 30698651
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Fast de Bruijn Graph Compaction in Distributed Memory Environments.
    Pan T; Nihalani R; Aluru S
    IEEE/ACM Trans Comput Biol Bioinform; 2020; 17(1):136-148. PubMed ID: 30072337
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Efficient solution for finding Hamilton cycles in undirected graphs.
    Alhalabi W; Kitanneh O; Alharbi A; Balfakih Z; Sarirete A
    Springerplus; 2016; 5(1):1192. PubMed ID: 27516930
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Benchmarking of de novo assembly algorithms for Nanopore data reveals optimal performance of OLC approaches.
    Cherukuri Y; Janga SC
    BMC Genomics; 2016 Aug; 17 Suppl 7(Suppl 7):507. PubMed ID: 27556636
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Bit-parallel sequence-to-graph alignment.
    Rautiainen M; Mäkinen V; Marschall T
    Bioinformatics; 2019 Oct; 35(19):3599-3607. PubMed ID: 30851095
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Integration of string and de Bruijn graphs for genome assembly.
    Huang YT; Liao CF
    Bioinformatics; 2016 May; 32(9):1301-7. PubMed ID: 26755626
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Hamiltonian cycles in planar cubic graphs with facial 2-factors, and a new partial solution of Barnette's Conjecture.
    Bagheri Gh B; Feder T; Fleischner H; Subi C
    J Graph Theory; 2021 Feb; 96(2):269-288. PubMed ID: 33380768
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Integrating long-range connectivity information into de Bruijn graphs.
    Turner I; Garimella KV; Iqbal Z; McVean G
    Bioinformatics; 2018 Aug; 34(15):2556-2565. PubMed ID: 29554215
    [TBL] [Abstract][Full Text] [Related]  

  • 14. A new algorithm to find fuzzy Hamilton cycle in a fuzzy network using adjacency matrix and minimum vertex degree.
    Nagoor Gani A; Latha SR
    Springerplus; 2016; 5(1):1854. PubMed ID: 27818892
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Assembly of long error-prone reads using de Bruijn graphs.
    Lin Y; Yuan J; Kolmogorov M; Shen MW; Chaisson M; Pevzner PA
    Proc Natl Acad Sci U S A; 2016 Dec; 113(52):E8396-E8405. PubMed ID: 27956617
    [TBL] [Abstract][Full Text] [Related]  

  • 16. What is the difference between the breakpoint graph and the de Bruijn graph?
    Lin Y; Nurk S; Pevzner PA
    BMC Genomics; 2014; 15 Suppl 6(Suppl 6):S6. PubMed ID: 25572416
    [TBL] [Abstract][Full Text] [Related]  

  • 17. MegaGTA: a sensitive and accurate metagenomic gene-targeted assembler using iterative de Bruijn graphs.
    Li D; Huang Y; Leung CM; Luo R; Ting HF; Lam TW
    BMC Bioinformatics; 2017 Oct; 18(Suppl 12):408. PubMed ID: 29072142
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Colored de Bruijn graphs and the genome halving problem.
    Alekseyev MA; Pevzner PA
    IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(1):98-107. PubMed ID: 17277417
    [TBL] [Abstract][Full Text] [Related]  

  • 19. HyDA-Vista: towards optimal guided selection of k-mer size for sequence assembly.
    Shariat B; Movahedi NS; Chitsaz H; Boucher C
    BMC Genomics; 2014; 15 Suppl 10(Suppl 10):S9. PubMed ID: 25558875
    [TBL] [Abstract][Full Text] [Related]  

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

    [Next]    [New Search]
    of 5.