M. Arita, Metabolic reconstruction using shortest paths, Simulation Practice and Theory, vol.8, pp.109-125, 2000.

M. Betz and H. Hild, Language models for a spelled letter recognizer, 1995 International Conference on Acoustics, Speech, and Signal Processing, vol.1, pp.856-859, 1995.

S. Clarke, A. Krikorian, and J. Rausen, Computing the n best loopless paths in a network, Journal of the Society for Industrial and Applied Mathematics, vol.11, pp.1096-1102, 1963.

C. Demetrescu, A. Goldberg, J. , and D. , , 2006.

D. Eppstein, Finding the k shortest paths, SIAM Journal on Computing, vol.28, pp.652-673, 1998.

D. Eppstein, , 2014.

G. Feng, Finding k shortest simple paths in directed graphs: A node classification algorithm, Networks, vol.64, pp.6-17, 2014.

M. L. Fredman, R. Sedgewick, D. D. Sleator, and R. E. Tarjan, The pairing heap: A new form of self-adjusting heap, Algorithmica, vol.1, pp.111-129, 1986.

D. Frigioni, A. Marchetti-spaccamela, N. , and U. , Fully dynamic algorithms for maintaining shortest paths trees, J. of Algorithms, vol.34, pp.251-281, 2000.

E. Hadjiconstantinou and N. Christofides, An efficient implementation of an algorithm for finding k shortest simple paths, An International Journal, vol.34, pp.88-101, 1999.

J. Hershberger, M. Maxel, and S. Suri, Finding the k shortest simple paths: A new algorithm and its implementation, ACM Transactions on Algorithms (TALG), vol.3, p.45, 2007.

W. Jin, S. Chen, and H. Jiang, Finding the k shortest paths in a time-schedule network with constraints on arcs, Computers & operations research, vol.40, pp.2975-2982, 2013.

N. Katoh, T. Ibaraki, and H. Mine, An efficient algorithm for k shortest simple paths, Networks, vol.12, pp.411-427, 1982.

D. Kurz, k-best enumeration -theory and application. Theses, 2018.

D. Kurz and P. Mutzel, A sidetrack-based algorithm for finding the k shortest simple paths in a directed graph, Int. Symp. on Algorithms and Computation (ISAAC) (2016), vol.64, pp.1-49

T. Shibuya and H. Imai, New flexible approaches for multiple sequence alignment, Journal of Computational Biology, vol.4, pp.385-413, 1997.

, The Sage Developers. SageMath, the Sage Mathematics Software System (Version 8.9, 2019.

W. Xu, S. He, R. Song, and S. S. Chaudhry, Finding the k shortest paths in a schedule-based transit network, Computers & Operations Research, vol.39, pp.1812-1826, 2012.

J. Y. Yen, Finding the k shortest loopless paths in a network, Management Science, vol.17, pp.712-716, 1971.