GTED: Graph Traversal Edit Distance

DOI10.1007/978-3-319-89929-9_3MaRDI QIDQ5881335zbMATH OpenOpenAlexFDO

Authors

Publication date 9 March 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-89929-9_3

zbMATH Keywords

edit distancegraph kernelsassembly graphEulerian traversalgeneration sequencing reads

Mathematics Subject Classification ID

Applications of graph theory (05C90) Linear programming (90C05) Protein sequences, DNA sequences (92D20) Systems biology, networks (92C42) Software, source code, etc. for problems pertaining to biology (92-04)

Recommendations

• Bridging the Gap between Graph Edit Distance and Kernel Machines
• Graph-Based Representations in Pattern Recognition
• A survey of graph edit distance
• Graph kernels
• Graph kernels

Cites work

• scientific article; zbMATH DE number 49719 (Why is no real title available?)
• scientific article; zbMATH DE number 523239 (Why is no real title available?)
• scientific article; zbMATH DE number 3240929 (Why is no real title available?)
• scientific article; zbMATH DE number 3068971 (Why is no real title available?)
• An Eulerian path approach to DNA fragment assembly
• Complete mining of frequent patterns from graphs: Mining graph data
• Graph kernels
• On Unicursal Paths in a Network of Degree 4
• Propagation kernels: efficient graph kernels from propagated information
• Weisfeiler-Lehman graph kernels

Cited in

(3)

• Synteny paths for assembly graphs comparison
• Revisiting the complexity of and algorithms for the graph traversal edit distance and its variants
• scientific article; zbMATH DE number 6262292 (Why is no real title available?)

Describes a project that uses

Uses Software

• GTED
• SEQuel
• AFGen

This page was built for publication: GTED: Graph Traversal Edit Distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5881335)