Conformance Algorithm used by Apromore

I am attempting to use Apromore in a scientific context and would therefore like to know what conformance checking algorithm is used by the platform. Does anybody have any knowledge about this?

Apromore uses a state-of-the-art algorithm for conformance checking based on automata (specifically Deterministic Acyclic Finite State Automata, or DAFSA), combined with an advanced technique for concurrency decomposition from Petri net theory known as “S-component decomposition”.
You can find the details of the algorithms in the following publication co-authored by three Apromore members: Scalable alignment of process models and event logs: An approach based on automata and S-components - ScienceDirect