BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

222 related articles for article (PubMed ID: 32058803)

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

  • 2. PyGTED: Python Application for Computing Graph Traversal Edit Distance.
    Ebrahimpour Boroojeny A; Shrestha A; Sharifi-Zarchi A; Gallagher SR; Sahinalp SC; Chitsaz H
    J Comput Biol; 2020 Mar; 27(3):436-439. PubMed ID: 32160033
    [No Abstract]   [Full Text] [Related]  

  • 3. Revisiting the complexity of and algorithms for the graph traversal edit distance and its variants.
    Qiu Y; Shen Y; Kingsford C
    Algorithms Mol Biol; 2024 Apr; 19(1):17. PubMed ID: 38679703
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Revisiting the Complexity of and Algorithms for the Graph Traversal Edit Distance and Its Variants.
    Qiu Y; Shen Y; Kingsford C
    ArXiv; 2023 Nov; ():. PubMed ID: 37292475
    [TBL] [Abstract][Full Text] [Related]  

  • 5. The effect of genome graph expressiveness on the discrepancy between genome graph distance and string set distance.
    Qiu Y; Kingsford C
    Bioinformatics; 2022 Jun; 38(Suppl 1):i404-i412. PubMed ID: 35758819
    [TBL] [Abstract][Full Text] [Related]  

  • 6. A binary linear programming formulation of the graph edit distance.
    Justice D; Hero A
    IEEE Trans Pattern Anal Mach Intell; 2006 Aug; 28(8):1200-14. PubMed ID: 16886857
    [TBL] [Abstract][Full Text] [Related]  

  • 7. A comparison of graph- and kernel-based -omics data integration algorithms for classifying complex traits.
    Yan KK; Zhao H; Pang H
    BMC Bioinformatics; 2017 Dec; 18(1):539. PubMed ID: 29212468
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Graph mining for next generation sequencing: leveraging the assembly graph for biological insights.
    Warnke-Sommer J; Ali H
    BMC Genomics; 2016 May; 17():340. PubMed ID: 27154001
    [TBL] [Abstract][Full Text] [Related]  

  • 9. GPD: a graph pattern diffusion kernel for accurate graph classification with applications in cheminformatics.
    Smalter A; Huan JL; Jia Y; Lushington G
    IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(2):197-207. PubMed ID: 20431140
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Approximate Graph Edit Distance in Quadratic Time.
    Riesen K; Ferrer M; Bunke H
    IEEE/ACM Trans Comput Biol Bioinform; 2020; 17(2):483-494. PubMed ID: 26390496
    [TBL] [Abstract][Full Text] [Related]  

  • 11. FastEtch: A Fast Sketch-Based Assembler for Genomes.
    Ghosh P; Kalyanaraman A
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(4):1091-1106. PubMed ID: 28910776
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 15. FSG: Fast String Graph Construction for De Novo Assembly.
    Bonizzoni P; Vedova GD; Pirola Y; Previtali M; Rizzi R
    J Comput Biol; 2017 Oct; 24(10):953-968. PubMed ID: 28715269
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 18. An Exact Algorithm to Compute the Double-Cut-and-Join Distance for Genomes with Duplicate Genes.
    Shao M; Lin Y; Moret BM
    J Comput Biol; 2015 May; 22(5):425-35. PubMed ID: 25517208
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Novel kernels for error-tolerant graph classification.
    Neuhaus M; Riesen K; Bunke H
    Spat Vis; 2009; 22(5):425-41. PubMed ID: 19814905
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Graph kernels combined with the neural network on protein classification.
    Qiangrong J; Guang Q
    J Bioinform Comput Biol; 2019 Oct; 17(5):1950030. PubMed ID: 31856667
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 12.