The SCEAS System
Navigation Menu

Conferences in DBLP

(stringology)
2009 (conf/stringology/2009)


  1. Combining Text Compression and String Matching: The Miracle of Self-Indexing. [Citation Graph (, )][DBLP]


  2. Feature Extraction for Image Pattern Matching with Cellular Automata. [Citation Graph (, )][DBLP]


  3. On-line Construction of a Small Automaton for a Finite Set of Words. [Citation Graph (, )][DBLP]


  4. Adapting Boyer-Moore-Like Algorithms for Searching Huffman Encoded Texts. [Citation Graph (, )][DBLP]


  5. Finding Characteristic Substrings from Compressed Texts. [Citation Graph (, )][DBLP]


  6. Delta Encoding in a Compressed Domain. [Citation Graph (, )][DBLP]


  7. On Bijective Variants of the Burrows-Wheeler Transform. [Citation Graph (, )][DBLP]


  8. On the Usefulness of Backspace. [Citation Graph (, )][DBLP]


  9. An Efficient Algorithm for Approximate Pattern Matching with Swaps. [Citation Graph (, )][DBLP]


  10. Searching for Jumbled Patterns in Strings. [Citation Graph (, )][DBLP]


  11. Filter Based Fast Matching of Long Patterns by Using SIMD Instructions. [Citation Graph (, )][DBLP]


  12. Validation and Decomposition of Partially Occluded Images with Holes. [Citation Graph (, )][DBLP]


  13. Compressing Bi-Level Images by Block Matching on a Tree Architecture. [Citation Graph (, )][DBLP]


  14. Taxonomies of Regular Tree Algorithms. [Citation Graph (, )][DBLP]


  15. String Suffix Automata and Subtree Pushdown Automata. [Citation Graph (, )][DBLP]


  16. On Minimizing Deterministic Tree Automata. [Citation Graph (, )][DBLP]


  17. Constant-memory Iterative Generation of Special Strings Representing Binary Trees. [Citation Graph (, )][DBLP]


  18. An Input Sensitive Online Algorithm for LCS Computation. [Citation Graph (, )][DBLP]


  19. Bit-parallel Algorithms for Computing all the Runs in a String. [Citation Graph (, )][DBLP]


  20. Crochemore's Repetitions Algorithm Revisited - Computing Runs. [Citation Graph (, )][DBLP]


  21. Reducing Repetitions. [Citation Graph (, )][DBLP]


  22. Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian Words. [Citation Graph (, )][DBLP]


  23. Parallel Algorithms for Degenerate and Weighted Sequences Derived from High Throughput Sequencing Technologies. [Citation Graph (, )][DBLP]


  24. Finding All Covers of an Indeterminate String in O(n) Time on Average. [Citation Graph (, )][DBLP]

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002