Trace alignment algorithm optimization

DOI10.1007/S10618-025-01130-6MaRDI QIDQ6939038zbMATH OpenFDO

Authors Leandro González-Montesino, Darian H. Grass-Boada

Publication date 22 August 2025

Published in Data Mining and Knowledge Discovery (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10618-025-01130-6

zbMATH Keywords

complexity theorycomputing scienceheuristicsprocess miningtrace alignment

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Applications of mathematical programming (90C90)

Cites work

• Algorithms on Strings, Trees and Sequences
• Applications and Theory of Petri Nets 2005
• Edit distance cannot be computed in strongly subquadratic time (unless SETH is false)
• Multiple sequence alignment using the hidden Markov model trained by an improved quantum-behaved particle swarm optimization
• Properties of Levenshtein metrics on sequences
• The Multiple Sequence Alignment Problem in Biology
• Which problems have strongly exponential complexity?

This page was built for publication: Trace alignment algorithm optimization

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