Commits · 431b7403869d4e93d52616dd90cec0fa3a7b61cd · 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.

May 10, 2018
- update construction of approximate matching automata · 431b7403
  Jan Trávníček authored 6 years ago
  
  431b7403
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
- Register all simulations form stringology::simulations. · 742bb2c9
  Tomáš Čapek authored 6 years ago
  
  742bb2c9
- 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
- add registration and call sample · b510fb2a
  Jan Trávníček authored 6 years ago
  
  b510fb2a
- 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
- Add registrations of all WildcardLinearString implementations in... · e1f59f63
  Tomáš Čapek authored 6 years ago and Jan Trávníček committed 6 years ago
  
  Add registrations of all WildcardLinearString implementations in stringology::matching::*Automaton classes.
  e1f59f63
- 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
May 02, 2018
- Position heap documentation and tuning · 0e85c9d7
  Jan Trávníček authored 6 years ago
  
  0e85c9d7
Apr 27, 2018
- document suffix array · ee759f5d
  Jan Trávníček authored 6 years ago
  
  ee759f5d
Apr 04, 2018
- refactor work of matching automata · 9385ba9e
  Jan Trávníček authored 6 years ago
  
  9385ba9e
- 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
- Refactor GeneralizedLevenshteinMatchingAutomaton - change style of main cycle. · 2cf3d15d
  Tomas Capek authored 6 years ago and Jan Trávníček committed 6 years ago
  
  2cf3d15d
- Refactor LevenshteinMatchingAutomaton - change main cycle. · 85a0706a
  Tomas Capek authored 6 years ago and Jan Trávníček committed 6 years ago
  
  85a0706a
- Implement algorithm for construction of matching automata using Generalized Levenshtein method. · 9ca6fa35
  Tomas Capek authored 7 years ago and Jan Trávníček committed 6 years ago
  
  9ca6fa35
- Refactor LevenshteinMatchingAutomaton. · 4c2f457d
  Tomas Capek authored 7 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 7 years ago and Jan Trávníček committed 6 years ago
  
  It now uses ext::pair<unsigned, unsigned> as a state type.
  41bdd07a
- Implement algorithm for construction of matching automata using Levenshtein method. · d11e9fb5
  Tomáš Čapek authored 7 years ago and Jan Trávníček committed 6 years ago
  
  d11e9fb5
- Implement algorithm for construciton of matching automata using Hamming method. · 36adf223
  Tomas Capek authored 7 years ago and Jan Trávníček committed 6 years ago
  
  36adf223
Apr 03, 2018
- Added Quick Search exact stringology matching algorithm. · 81ffaab4
  Michal Cvach authored 7 years ago and Jan Trávníček committed 6 years ago
  
  81ffaab4
Feb 13, 2018
- update suffix automaton and factor oracle indexes · 997692cb
  Jan Trávníček authored 7 years ago
  
  997692cb