The SCEAS System
Navigation Menu

Conferences in DBLP

Combinatorial Pattern Matching (CPM) (cpm)
2008 (conf/cpm/2008)

  1. ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations. [Citation Graph (, )][DBLP]

  2. Lower Bounds for Succinct Data Structures. [Citation Graph (, )][DBLP]

  3. The Changing Face of Web Search. [Citation Graph (, )][DBLP]

  4. Two-Dimensional Pattern Matching with Combined Scaling and Rotation. [Citation Graph (, )][DBLP]

  5. Searching for Gapped Palindromes. [Citation Graph (, )][DBLP]

  6. Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. [Citation Graph (, )][DBLP]

  7. Finding Largest Well-Predicted Subset of Protein Structure Models. [Citation Graph (, )][DBLP]

  8. HP Distance Via Double Cut and Join Distance. [Citation Graph (, )][DBLP]

  9. Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots. [Citation Graph (, )][DBLP]

  10. Faster Algorithm for the Set Variant of the String Barcoding Problem. [Citation Graph (, )][DBLP]

  11. Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics. [Citation Graph (, )][DBLP]

  12. Analysis of the Size of Antidictionary in. [Citation Graph (, )][DBLP]

  13. Approximate String Matching with Address Bit Errors. [Citation Graph (, )][DBLP]

  14. On-Line Approximate String Matching with Bounded Errors. [Citation Graph (, )][DBLP]

  15. A Black Box for Online Approximate Pattern Matching. [Citation Graph (, )][DBLP]

  16. An(other) Entropy-Bounded Compressed Suffix Tree. [Citation Graph (, )][DBLP]

  17. On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices. [Citation Graph (, )][DBLP]

  18. Computing Inverse ST in Linear Complexity. [Citation Graph (, )][DBLP]

  19. Dynamic Fully-Compressed Suffix Trees. [Citation Graph (, )][DBLP]

  20. A Linear Delay Algorithm for Building Concept Lattices. [Citation Graph (, )][DBLP]

  21. Matching Integer Intervals by Minimal Sets of Binary Words with don't cares. [Citation Graph (, )][DBLP]

  22. Fast Algorithms for Computing Tree LCS. [Citation Graph (, )][DBLP]

  23. Why Greed Works for Shortest Common Superstring Problem. [Citation Graph (, )][DBLP]

  24. Constrained LCS: Hardness and Approximation. [Citation Graph (, )][DBLP]

  25. Finding Additive Biclusters with Random Background. [Citation Graph (, )][DBLP]

  26. An Improved Succinct Representation for Dynamic k-ary Trees. [Citation Graph (, )][DBLP]

  27. Towards a Solution to the "Runs" Conjecture. [Citation Graph (, )][DBLP]

  28. On the Longest Common Parameterized Subsequence. [Citation Graph (, )][DBLP]

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002