Algorithms. 31. PERMUT. Simple algorithm generating all permutations
Zdeněk Režný, Evžen Kindler (1973)
Aplikace matematiky
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Faster backtracking algorithms for the generation of symmetry-invariant permutations.”
Algorithms. 31. PERMUT. Simple algorithm generating all permutations
Enumeration of factorizable multi-dimensional permutations.
Zhang, Hao, Gildea, Daniel (2007)
Journal of Integer Sequences [electronic only]
Similarity:
Simple and efficient bilayer cross counting.
Barth, Wilhelm, Mutzel, Petra, Jünger, Michael (2004)
Journal of Graph Algorithms and Applications
Similarity:
Completion of the Wilf-classification of 3-5 pairs using generating trees.
Lipson, Mark (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A sparse dynamic programming algorithm for alignment with non-overlapping inversions
Alair Pereira Do Lago, Ilya Muchnik, Casimir Kulikowski (2005)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Alignment of sequences is widely used for biological sequence comparisons, and only biological events like mutations, insertions and deletions are considered. Other biological events like inversions are not automatically detected by the usual alignment algorithms, thus some alternative approaches have been tried in order to include inversions or other kinds of rearrangements. Despite many important results in the last decade, the complexity of the problem of alignment with inversions...
Sorting with a forklift.
Albert, M.H., Atkinson, M.D. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A survey of stack-sorting disciplines.
Bóna, Miklós (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Accelerating backtrack search with a best-first-search strategy
Zoltán Ádám Mann, Tamás Szép (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Accelerating backtrack search with a best-first-search strategy
Zoltán Ádám Mann, Tamás Szép (2014)
International Journal of Applied Mathematics and Computer Science
Similarity: