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 *

121 related articles for article (PubMed ID: 37734700)

  • 1. Quantum algorithm for de novo DNA sequence assembly based on quantum walks on graphs.
    Varsamis GD; Karafyllidis IG; Gilkes KM; Arranz U; Martin-Cuevas R; Calleja G; Wong J; Jessen HC; Dimitrakis P; Kolovos P; Sandaltzopoulos R
    Biosystems; 2023 Nov; 233():105037. PubMed ID: 37734700
    [TBL] [Abstract][Full Text] [Related]  

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

  • 3. Algorithm for DNA sequence assembly by quantum annealing.
    Nałęcz-Charkiewicz K; Nowak RM
    BMC Bioinformatics; 2022 Apr; 23(1):122. PubMed ID: 35392798
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs.
    Kundeti VK; Rajasekaran S; Dinh H; Vaughn M; Thapar V
    BMC Bioinformatics; 2010 Nov; 11():560. PubMed ID: 21078174
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Using Apache Spark on genome assembly for scalable overlap-graph reduction.
    Paul AJ; Lawrence D; Song M; Lim SH; Pan C; Ahn TH
    Hum Genomics; 2019 Oct; 13(Suppl 1):48. PubMed ID: 31639049
    [TBL] [Abstract][Full Text] [Related]  

  • 6. RResolver: efficient short-read repeat resolution within ABySS.
    Nikolić V; Afshinfard A; Chu J; Wong J; Coombe L; Nip KM; Warren RL; Birol I
    BMC Bioinformatics; 2022 Jun; 23(1):246. PubMed ID: 35729491
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Heuristic pairwise alignment of de Bruijn graphs to facilitate simultaneous transcript discovery in related organisms from RNA-Seq data.
    Fu S; Tarone AM; Sze SH
    BMC Genomics; 2015; 16 Suppl 11(Suppl 11):S5. PubMed ID: 26576690
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Quadratic Speedup for Spatial Search by Continuous-Time Quantum Walk.
    Apers S; Chakraborty S; Novo L; Roland J
    Phys Rev Lett; 2022 Oct; 129(16):160502. PubMed ID: 36306753
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Computing paths and cycles in biological interaction graphs.
    Klamt S; von Kamp A
    BMC Bioinformatics; 2009 Jun; 10():181. PubMed ID: 19527491
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Systematic Dimensionality Reduction for Quantum Walks: Optimal Spatial Search and Transport on Non-Regular Graphs.
    Novo L; Chakraborty S; Mohseni M; Neven H; Omar Y
    Sci Rep; 2015 Sep; 5():13304. PubMed ID: 26330082
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Spatial Search by Quantum Walk is Optimal for Almost all Graphs.
    Chakraborty S; Novo L; Ambainis A; Omar Y
    Phys Rev Lett; 2016 Mar; 116(10):100501. PubMed ID: 27015464
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Experimental Parity-Time Symmetric Quantum Walks for Centrality Ranking on Directed Graphs.
    Wu T; Izaac JA; Li ZX; Wang K; Chen ZZ; Zhu S; Wang JB; Ma XS
    Phys Rev Lett; 2020 Dec; 125(24):240501. PubMed ID: 33412067
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Efficient construction of an assembly string graph using the FM-index.
    Simpson JT; Durbin R
    Bioinformatics; 2010 Jun; 26(12):i367-73. PubMed ID: 20529929
    [TBL] [Abstract][Full Text] [Related]  

  • 14. TraRECo: a greedy approach based de novo transcriptome assembler with read error correction using consensus matrix.
    Yoon S; Kim D; Kang K; Park WJ
    BMC Genomics; 2018 Sep; 19(1):653. PubMed ID: 30180798
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Marking Vertices to Find Graph Isomorphism Mapping Based on Continuous-Time Quantum Walk.
    Wang X; Zhang Y; Lu K; Wang X; Liu K
    Entropy (Basel); 2018 Aug; 20(8):. PubMed ID: 33265675
    [TBL] [Abstract][Full Text] [Related]  

  • 16. METAMVGL: a multi-view graph-based metagenomic contig binning algorithm by integrating assembly and paired-end graphs.
    Zhang Z; Zhang L
    BMC Bioinformatics; 2021 Jul; 22(Suppl 10):378. PubMed ID: 34294039
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Deterministic Search on Star Graphs via Quantum Walks.
    Qu D; Marsh S; Wang K; Xiao L; Wang J; Xue P
    Phys Rev Lett; 2022 Feb; 128(5):050501. PubMed ID: 35179941
    [TBL] [Abstract][Full Text] [Related]  

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

  • 19. A memory-efficient data structure representing exact-match overlap graphs with application for next-generation DNA assembly.
    Dinh H; Rajasekaran S
    Bioinformatics; 2011 Jul; 27(14):1901-7. PubMed ID: 21636593
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Quantum walks on regular uniform hypergraphs.
    Liu Y; Yuan J; Duan B; Li D
    Sci Rep; 2018 Jun; 8(1):9548. PubMed ID: 29934645
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.