The following pages link to Sebastian Deorowicz (Q436552):
Displaying 18 items.
- Quadratic-time algorithm for a string constrained LCS problem (Q436553) (← links)
- Speeding up transposition-invariant string matching (Q845816) (← links)
- An algorithm for solving the longest increasing circular subsequence problem (Q987842) (← links)
- Context exhumation after the Burrows-Wheeler transform (Q1041774) (← links)
- Efficient algorithms for the longest common subsequence in \(k\)-length substrings (Q2252645) (← links)
- Second step algorithms in the Burrows-Wheeler compression algorithm (Q2783312) (← links)
- How to squeeze a lexicon (Q2783368) (← links)
- (Q2970219) (← links)
- (Q4582900) (← links)
- Improvements to Burrows-Wheeler compression algorithm (Q4791703) (← links)
- A PARALLEL ALGORITHM FOR THE CONSTRAINED MULTIPLE SEQUENCE ALIGNMENT PROBLEM DESIGNED FOR GPUs (Q4902884) (← links)
- Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem (Q4932075) (← links)
- BIT-PARALLEL ALGORITHMS FOR THE MERGED LONGEST COMMON SUBSEQUENCE PROBLEM (Q5168418) (← links)
- On Two Variants of the Longest Increasing Subsequence Problem (Q5188712) (← links)
- Computing the Longest Common Transposition-Invariant Subsequence with GPU (Q5188713) (← links)
- AGC archives of human and SARS-CoV-2 genomes (Q6682225) (← links)
- extHomFam 2: large-scale benchmark for protein multiple sequence alignments (Q6695332) (← links)
- Supplementary tables for publication "A reference-free algorithm discovers regulation in the plant transcriptome" (Q6717751) (← links)
