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 *

123 related articles for article (PubMed ID: 37734700)

  • 21. A parameter-independent algorithm of finding maximum clique with Seidel continuous-time quantum walks.
    Li X; Chen X; Hu S; Xu J; Liu Z
    iScience; 2024 Feb; 27(2):108953. PubMed ID: 38333715
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Scaling metagenome sequence assembly with probabilistic de Bruijn graphs.
    Pell J; Hintze A; Canino-Koning R; Howe A; Tiedje JM; Brown CT
    Proc Natl Acad Sci U S A; 2012 Aug; 109(33):13272-7. PubMed ID: 22847406
    [TBL] [Abstract][Full Text] [Related]  

  • 23. A memory-efficient algorithm to obtain splicing graphs and de novo expression estimates from de Bruijn graphs of RNA-Seq data.
    Sze SH; Tarone AM
    BMC Genomics; 2014; 15 Suppl 5(Suppl 5):S6. PubMed ID: 25082000
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Measuring graph similarity through continuous-time quantum walks and the quantum Jensen-Shannon divergence.
    Rossi L; Torsello A; Hancock ER
    Phys Rev E Stat Nonlin Soft Matter Phys; 2015 Feb; 91(2):022815. PubMed ID: 25768560
    [TBL] [Abstract][Full Text] [Related]  

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

  • 26. On the Hardness of Sequence Alignment on De Bruijn Graphs.
    Gibney D; Thankachan SV; Aluru S
    J Comput Biol; 2022 Dec; 29(12):1377-1396. PubMed ID: 36450127
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Coverage-preserving sparsification of overlap graphs for long-read assembly.
    Jain C
    Bioinformatics; 2023 Mar; 39(3):. PubMed ID: 36892439
    [TBL] [Abstract][Full Text] [Related]  

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

  • 29. RGFA: powerful and convenient handling of assembly graphs.
    Gonnella G; Kurtz S
    PeerJ; 2016; 4():e2681. PubMed ID: 27843717
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Backtrackless walks on a graph.
    Aziz F; Wilson RC; Hancock ER
    IEEE Trans Neural Netw Learn Syst; 2013 Jun; 24(6):977-89. PubMed ID: 24808478
    [TBL] [Abstract][Full Text] [Related]  

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

  • 32. Graph coloring using the reduced quantum genetic algorithm.
    Ardelean SM; Udrescu M
    PeerJ Comput Sci; 2022; 8():e836. PubMed ID: 35111921
    [TBL] [Abstract][Full Text] [Related]  

  • 33. ISEA: Iterative Seed-Extension Algorithm for De Novo Assembly Using Paired-End Information and Insert Size Distribution.
    Li M; Liao Z; He Y; Wang J; Luo J; Pan Y
    IEEE/ACM Trans Comput Biol Bioinform; 2017; 14(4):916-925. PubMed ID: 27076460
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Compacting de Bruijn graphs from sequencing data quickly and in low memory.
    Chikhi R; Limasset A; Medvedev P
    Bioinformatics; 2016 Jun; 32(12):i201-i208. PubMed ID: 27307618
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Restarting and recentering genetic algorithm variations for DNA fragment assembly: The necessity of a multi-strategy approach.
    Hughes JA; Houghten S; Ashlock D
    Biosystems; 2016 Dec; 150():35-45. PubMed ID: 27521768
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Optimal parallel algorithm for shortest paths problem on interval graphs.
    Mishra PK
    J Zhejiang Univ Sci; 2004 Sep; 5(9):1135-43. PubMed ID: 15323010
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Quantum walk processes in quantum devices.
    Madhu AK; Melnikov AA; Fedichkin LE; Alodjants AP; Lee RK
    Heliyon; 2023 Mar; 9(3):e13416. PubMed ID: 36895413
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Exploiting sparseness in de novo genome assembly.
    Ye C; Ma ZS; Cannon CH; Pop M; Yu DW
    BMC Bioinformatics; 2012 Apr; 13 Suppl 6(Suppl 6):S1. PubMed ID: 22537038
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Graph Traversal Edit Distance and Extensions.
    Ebrahimpour Boroojeny A; Shrestha A; Sharifi-Zarchi A; Gallagher SR; Sahinalp SC; Chitsaz H
    J Comput Biol; 2020 Mar; 27(3):317-329. PubMed ID: 32058803
    [No Abstract]   [Full Text] [Related]  

  • 40. A Hybrid Parallel Strategy Based on String Graph Theory to Improve De Novo DNA Assembly on the TianHe-2 Supercomputer.
    Zhang F; Liao X; Peng S; Cui Y; Wang B; Zhu X; Liu J
    Interdiscip Sci; 2016 Jun; 8(2):169-176. PubMed ID: 26403255
    [TBL] [Abstract][Full Text] [Related]  

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