The following pages link to Solon P. Pissis (Q294953):
Displaying 50 items.
- Order-preserving indexing (Q294954) (← links)
- (Q390903) (redirect page) (← links)
- Efficient seed computation revisited (Q390905) (← links)
- Enhanced string covering (Q393116) (← links)
- Tree template matching in unranked ordered trees (Q396647) (← links)
- An algorithm for mapping short reads to a dynamically changing genomic sequence (Q414417) (← links)
- Fast algorithm for partial covers in words (Q493243) (← links)
- Linear-time computation of prefix table for weighted strings {\&} applications (Q507393) (← links)
- Linear-time superbubble identification algorithm for genome assembly (Q897907) (← links)
- How to answer a small batch of RMQs or LCA queries in practice (Q1642718) (← links)
- Minimal absent words in a sliding window and applications to on-line pattern matching (Q1679968) (← links)
- Efficient algorithms for shortest partial seeds in words (Q1698721) (← links)
- Optimal computation of avoided words (Q1708407) (← links)
- Crochemore's partitioning on weighted strings and applications (Q1709578) (← links)
- On-line weighted pattern matching (Q1740646) (← links)
- Alignment-free sequence comparison using absent words (Q1784946) (← links)
- Near-optimal computation of runs over general alphabet via non-crossing LCE queries (Q1796824) (← links)
- Computing all subtree repeats in ordered trees (Q1941702) (← links)
- Pattern matching and consensus problems on weighted sequences and profiles (Q2000001) (← links)
- Efficient pattern matching in elastic-degenerate strings (Q2042726) (← links)
- Constructing antidictionaries of long texts in output-sensitive space (Q2048208) (← links)
- Efficient computation of sequence mappability (Q2134748) (← links)
- Beyond the BEST theorem: fast assessment of Eulerian trails (Q2140495) (← links)
- All-pairs suffix/prefix in optimal time using Aho-Corasick space (Q2169425) (← links)
- Dynamic and internal longest common substring (Q2211363) (← links)
- Influence maximization in the presence of vulnerable nodes: a ratio perspective (Q2220831) (← links)
- Absent words in a sliding window with applications (Q2288209) (← links)
- Indexing weighted sequences: neat and efficient (Q2288210) (← links)
- Property suffix array with applications (Q2294694) (← links)
- Approximate pattern matching on elastic-degenerate text (Q2297854) (← links)
- Longest property-preserved common factor: a new string-processing framework (Q2297866) (← links)
- On overabundant words and their application to biological sequence analysis (Q2326388) (← links)
- Global and local sequence alignment with a bounded number of gaps (Q2342666) (← links)
- Tree template matching in ranked ordered trees by pushdown automata (Q2376785) (← links)
- On left and right seeds of a string (Q2376787) (← links)
- Extending alignments with \(k\)-mismatches and \(\ell\)-gaps (Q2437749) (← links)
- Internal shortest absent word queries in constant time and linear space (Q2672592) (← links)
- Average-Case Optimal Approximate Circular String Matching (Q2799164) (← links)
- Linear-Time Sequence Comparison Using Minimal Absent Words & Applications (Q2802951) (← links)
- An Optimal Algorithm for Computing All Subtree Repeats in Trees (Q2870033) (← links)
- PARALLEL ALGORITHMS FOR MAPPING SHORT DEGENERATE AND WEIGHTED DNA SEQUENCES TO A REFERENCE GENOME (Q2909194) (← links)
- Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance (Q2946041) (← links)
- Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment (Q2948308) (← links)
- An optimal algorithm for computing all subtree repeats in trees (Q2955638) (← links)
- On-Line Pattern Matching on Uncertain Sequences and Applications (Q2958345) (← links)
- Fast circular dictionary-matching algorithm (Q2971059) (← links)
- Efficient Seeds Computation Revisited (Q3011867) (← links)
- On the Right-Seed Array of a String (Q3087974) (← links)
- Searching and Indexing Circular Patterns (Q3305518) (← links)
- Linear-Time Computation of Prefix Table for Weighted Strings (Q3449358) (← links)
