Krzysztof Turowski

Results 10 issues of Krzysztof Turowski

Example publications for LCS: - [ ] Apostolico, Guerra - The longest common subsequence problem revisited - [ ] Apostolico, Browne, Guerra - Fast linear-space computations of longest common subsequences...

documentation
enhancement

Approximate string matching with respect to the edit distance: - [ ] Galil, Giancarlo - Improved String Matching with k Mismatches - requires also computation LCP(i, j) in $O(1)$ time...

documentation
enhancement

Example publications for suffix tree: - [ ] Breslauer, Italiano - Near real-time suffix tree construction via the fringe marked ancestor problem - [ ] Giegerich, Kurtz, Stoye - Efficient...

documentation
enhancement

- [ ] a 5/2-approximation algorithm from Sweedyk - A 2 1/2-approximation algorithm for shortest superstring - [ ] a 5/2-approximation algorithm from Kaplan, Shafrir - The greedy algorithm for...

documentation
enhancement

- [ ] Fischer - Inducing the LCP-Array - [ ] Gog, Ohlebusch - Compressed Suffix Trees: Efficient Computation and Storage of LCP-Values (conference version: Fast and Lightweight LCP-Array Construction...

documentation
enhancement

- [ ] Hancart - On Simon's string searching algorithm (Simon-Hancart algorithm) - [ ] Breslauer, Galil - Efficient comparison based string matching - [ ] Colussi - Correctness and...

documentation
enhancement

Example publications: - [ ] LZ-index from Navarro - Indexing text using the Ziv-Lempel trie, - [ ] FM-index from Ferragina, Manzini - Opportunistic data structures with applications, - [...

documentation
enhancement

Overall, the aim is to implement several BTW and IBWT transformation algorithms, and to compare them in terms of efficiency (number of accesses of characters) and running time. Selected relevant...

documentation
enhancement

Overall, the aim is to implement several LZ77/78 decomposition algorithms and their reverse methods, and to compare them in terms of efficiency (number of accesses of characters) and running time....

documentation
enhancement

The following test: ``` approximate_string_matching.lcs.four_russians( '#bbbaaab', '#aaaabbb', 7, 7, approximate_string_matching.distance.INDEL_DISTANCE) ``` returns 3 instead of 4. There has to be a bug somewhere in [four_russians.py](https://github.com/krzysztof-turowski/string-algorithms/tree/master/approximate_string_matching/four_russians.py)

bug