159 related articles for article (PubMed ID: 32160033)
1. 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]
2. 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]
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. 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]
6. 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]
7. 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]
8. graphkernels: R and Python packages for graph comparison.
Sugiyama M; Ghisu ME; Llinares-López F; Borgwardt K
Bioinformatics; 2018 Feb; 34(3):530-532. PubMed ID: 29028902
[TBL] [Abstract][Full Text] [Related]
9. Graph edit distance from spectral seriation.
Robles-Kelly A; Hancock ER
IEEE Trans Pattern Anal Mach Intell; 2005 Mar; 27(3):365-378. PubMed ID: 15747792
[TBL] [Abstract][Full Text] [Related]
10. Learning the Edit Costs of Graph Edit Distance Applied to Ligand-Based Virtual Screening.
Garcia-Hernandez C; Fernández A; Serratosa F
Curr Top Med Chem; 2020; 20(18):1582-1592. PubMed ID: 32493194
[TBL] [Abstract][Full Text] [Related]
11. Coupling Graphs, Efficient Algorithms and B-Cell Epitope Prediction.
Liang Zhao ; Hoi SC; Li Z; Wong L; Nguyen H; Li J
IEEE/ACM Trans Comput Biol Bioinform; 2014; 11(1):7-16. PubMed ID: 26355502
[TBL] [Abstract][Full Text] [Related]
12. 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]
13. Ligand-Based Virtual Screening Using Graph Edit Distance as Molecular Similarity Measure.
Garcia-Hernandez C; Fernández A; Serratosa F
J Chem Inf Model; 2019 Apr; 59(4):1410-1421. PubMed ID: 30920214
[TBL] [Abstract][Full Text] [Related]
14. Ligand-Based Virtual Screening Based on the Graph Edit Distance.
Rica E; Álvarez S; Serratosa F
Int J Mol Sci; 2021 Nov; 22(23):. PubMed ID: 34884555
[TBL] [Abstract][Full Text] [Related]
15. Efficient and scalable graph similarity joins in MapReduce.
Chen Y; Zhao X; Xiao C; Zhang W; Tang J
ScientificWorldJournal; 2014; 2014():749028. PubMed ID: 25121135
[TBL] [Abstract][Full Text] [Related]
16. A novel graph kernel on chemical compound classification.
Jiang Q; Ma J
J Bioinform Comput Biol; 2018 Dec; 16(6):1850026. PubMed ID: 30567474
[TBL] [Abstract][Full Text] [Related]
17. Linear space string correction algorithm using the Damerau-Levenshtein distance.
Zhao C; Sahni S
BMC Bioinformatics; 2020 Dec; 21(Suppl 1):4. PubMed ID: 33297940
[TBL] [Abstract][Full Text] [Related]
18. A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures.
Fukagawa D; Tamura T; Takasu A; Tomita E; Akutsu T
BMC Bioinformatics; 2011 Feb; 12 Suppl 1(Suppl 1):S13. PubMed ID: 21342542
[TBL] [Abstract][Full Text] [Related]
19. Self-organizing maps for learning the edit costs in graph matching.
Neuhaus M; Bunke H
IEEE Trans Syst Man Cybern B Cybern; 2005 Jun; 35(3):503-14. PubMed ID: 15971918
[TBL] [Abstract][Full Text] [Related]
20. Error Tree: A Tree Structure for Hamming and Edit Distances and Wildcards Matching.
Al-Okaily A
J Comput Biol; 2015 Dec; 22(12):1118-28. PubMed ID: 26402070
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
