Commits · de75b2c02201e3cb7f094c4e6d375c8fd013e1c5 · Algorithms Library Toolkit / Algorithms Library Toolkit Core · GitLab

Snippets Groups Projects

From 1. 4., DockerHub introduces new very strict rate limitations on docker image pulls.

Consider changing FROM tags in dockerfiles to use altenative providers or add login step at the beginning of CI/CD job as authenticated requests aren't affected.

Sep 25, 2018
- template random automaton and grammar factory · de75b2c0
  Jan Trávníček authored 6 years ago
  
  de75b2c0
Sep 20, 2018
- proper template of to CNF conversion algorithm · fc93de29
  Jan Trávníček authored 6 years ago
  
  fc93de29
Sep 19, 2018
- template grammar ToAutomaton algorithm · bf8c9ecd
  Jan Trávníček authored 6 years ago
  
  bf8c9ecd
- working template redesign for regular and context free grammars · d2e01be5
  Jan Trávníček authored 6 years ago
  
  d2e01be5
Sep 18, 2018
- template ToAutomatonBottomUp algorithm · 235a9585
  Jan Trávníček authored 6 years ago
  
  235a9585
- improve ToCNF algo · fe65fdb2
  Jan Trávníček authored 6 years ago
  
  fe65fdb2
- fix integer constant type · c2dd6095
  Jan Trávníček authored 6 years ago
  
  c2dd6095
Sep 09, 2018
- Glushkov algorithm implementation improvements · a38c2694
  Jan Trávníček authored 6 years ago
  
  a38c2694
Sep 08, 2018
- fix different results of automaton vs dynamic programming distance · d8858fb1
  Jan Trávníček authored 6 years ago
  
  simulation
  d8858fb1
May 15, 2018
- decouple automata and their xml api · 61227762
  Jan Trávníček authored 6 years ago
  
  61227762
May 08, 2018
- Remove stringology::matching::HammingMatchingAutomaton::construct_unclean()... · b64034dd
  Tomas Capek authored 6 years ago
  
  Remove stringology::matching::HammingMatchingAutomaton::construct_unclean() and ajdust tests accordingly.
  View commits for tag BP_capekto4 BP_capekto4
  
  b64034dd
- Refactor stringology::simulations::HammingDynamicProgramming, so it uses · f797441a
  Tomáš Čapek authored 6 years ago
  
  the same base algorithm as the rest of dynamic programing simulations.
  f797441a
- Implement simulation for aproximate string matching using dynamic programming... · b13ebefe
  Tomas Capek authored 6 years ago
  
  Implement simulation for aproximate string matching using dynamic programming and General Levenshtein distance.
  b13ebefe
- Rework simulation of Levenshtein searching automaton. · f841f3e3
  Tomas Capek authored 6 years ago
  
  f841f3e3
- Change return value in simulations to ext::set<unsigned int>. · 20eaab0d
  Tomas Capek authored 6 years ago
  
  20eaab0d
- Implement simulation for aproximate string matching using dynamic programming... · f0c491da
  Tomas Capek authored 6 years ago
  
  Implement simulation for aproximate string matching using dynamic programming and Levenshtein distance.
  f0c491da
- Fix incorectly implemented position reporting in BitParalelism. · cc40bf3c
  Tomas Capek authored 6 years ago
  
  cc40bf3c
- Implement simulation for aproximate string matching using dynamic programming... · 891846d9
  Tomas Capek authored 6 years ago
  
  Implement simulation for aproximate string matching using dynamic programming and Levenshtein distance.
  891846d9
- Implement simulation for aproximate string matching using dynamic programming and Hamming distance. · 171e15b9
  Tomas Capek authored 6 years ago
  
  171e15b9
- Implement simulation for aproximate string matching using bit paralelism and... · ee84106e
  Tomáš Čapek authored 6 years ago
  
  Implement simulation for aproximate string matching using bit paralelism and Generalized Levenshtein distance.
  ee84106e
- Implement simulation for aproximate string matching using bit paralelism and Levenshtein distance. · 6efe6733
  Tomáš Čapek authored 6 years ago
  
  6efe6733
- Implements simulation for aproximate string matching using bit paralelism and Hamming distance. · 98180caa
  Tomáš Čapek authored 6 years ago
  
  98180caa
- Implements simulation for exact string matching using bit paralelism. · 539bfae7
  Tomáš Čapek authored 6 years ago
  
  539bfae7
May 07, 2018
- Implement WildcardLinearString into GeneralizedLevenshteinSequenceMatchingAutomaton · 82aa1ce9
  Tomáš Čapek authored 6 years ago and Jan Trávníček committed 6 years ago
  
  82aa1ce9
- Implement WildcardLinearString into LevenshteinSequenceMatchingAutomaton · 03443ad1
  Tomáš Čapek authored 6 years ago and Jan Trávníček committed 6 years ago
  
  03443ad1
- Implement WildcardLinearString into HammingSequenceMatchingAutomaton · 50534f65
  Tomáš Čapek authored 6 years ago and Jan Trávníček committed 6 years ago
  
  50534f65
- Implement WildcardLinearString into GeneralizedLevenshteinMatchingAutomaton. · 7ef4f3cd
  Tomáš Čapek authored 6 years ago and Jan Trávníček committed 6 years ago
  
  7ef4f3cd
- Implement WildcardLinearString into LevenshteinMatchingAutomaton · 700f8416
  Tomáš Čapek authored 6 years ago and Jan Trávníček committed 6 years ago
  
  700f8416
- Implement WildcardLinearString into HammingMatchingAutomaton. · a3972834
  Tomáš Čapek authored 6 years ago and Jan Trávníček committed 6 years ago
  
  a3972834
May 04, 2018
- update string indexes · 0b9faa97
  Jan Trávníček authored 6 years ago
  
  0b9faa97
Apr 24, 2018
- adapt regexps and rtes to changes in tree_base · ecee6795
  Jan Trávníček authored 6 years ago
  
  ecee6795
Apr 10, 2018
- push xml api of regexps to separate files · 960dc1bc
  Jan Trávníček authored 6 years ago
  
  960dc1bc
Apr 07, 2018
- more precise construction of automaton by derivatives · 414f0438
  Jan Trávníček authored 6 years ago
  
  414f0438
Apr 04, 2018
- Implement GeneralizedLevenshteinSequenceMatchingAutomaton. · 6d88134c
  Tomas Capek authored 6 years ago and Jan Trávníček committed 6 years ago
  
  6d88134c
- Implement LevenshteinSequenceMatchingAutomaton. · 15c8e069
  Tomas Capek authored 6 years ago and Jan Trávníček committed 6 years ago
  
  15c8e069
- Implement HammingSequenceMatchingAutomaton. · eb6148b7
  Tomas Capek authored 6 years ago and Jan Trávníček committed 6 years ago
  
  eb6148b7
- Implement SequenceMatchingAutomaton. · e0c2e39c
  Tomas Capek authored 6 years ago and Jan Trávníček committed 6 years ago
  
  e0c2e39c
- Implement algorithm for construction of matching automata using Generalized Levenshtein method. · 9ca6fa35
  Tomas Capek authored 6 years ago and Jan Trávníček committed 6 years ago
  
  9ca6fa35
- Refactor LevenshteinMatchingAutomaton. · 4c2f457d
  Tomas Capek authored 6 years ago and Jan Trávníček committed 6 years ago
  
  It now uses ext::pair<unsigned, unsigned> as a state type.
  4c2f457d
- Refactor HammingMatchingAutomaton. · 41bdd07a
  Tomas Capek authored 6 years ago and Jan Trávníček committed 6 years ago
  
  It now uses ext::pair<unsigned, unsigned> as a state type.
  41bdd07a