Table of Contents Tricks with match bonus or how to fool Dijkstra’s limitationsEdit graph Algorithms PotentialsMultiple variants Some notes on algorithmsWFA A* Extending to different cost modelsAffine costs Substitution matrices But not local alignment EvaluationsUnequal string length Equal string lengths Conclusion Tricks with match bonus or how to fool Dijkstra’s limitations The reader is assumed to have basic knowledge about pairwise alignment and graph theory.
