Revisiting the Complexity of and Algorithms for the Graph Traversal Edit Distance and Its Variants

The graph traversal edit distance (GTED), introduced by Ebrahimpour Boroojeny et al.~(2018), is an elegant distance measure defined as the minimum edit distance between strings reconstructed from Eulerian trails in two edge-labeled graphs. GTED can be used to infer evolutionary relationships between...

Descripción completa

Detalles Bibliográficos
Autores principales: Qiu, Yutong, Shen, Yihang, Kingsford, Carl
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Cornell University 2023
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10246088/
https://www.ncbi.nlm.nih.gov/pubmed/37292475

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10246088/
https://www.ncbi.nlm.nih.gov/pubmed/37292475

Ejemplares similares