The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Algorithms for Forest Pattern Matching. [Citation Graph (, )][DBLP]

  2. Affine Image Matching Is Uniform TC0-Complete. [Citation Graph (, )][DBLP]

  3. Old and New in Stringology. [Citation Graph (, )][DBLP]

  4. Small-Space 2D Compressed Dictionary Matching. [Citation Graph (, )][DBLP]

  5. Bidirectional Search in a String with Wavelet Trees. [Citation Graph (, )][DBLP]

  6. A Minimal Periods Algorithm with Applications. [Citation Graph (, )][DBLP]

  7. The Property Suffix Tree with Dynamic Properties. [Citation Graph (, )][DBLP]

  8. Approximate All-Pairs Suffix/Prefix Overlaps. [Citation Graph (, )][DBLP]

  9. Succinct Dictionary Matching with No Slowdown. [Citation Graph (, )][DBLP]

  10. Pseudo-realtime Pattern Matching: Closing the Gap. [Citation Graph (, )][DBLP]

  11. Breakpoint Distance and PQ-Trees. [Citation Graph (, )][DBLP]

  12. On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs. [Citation Graph (, )][DBLP]

  13. Succinct Representations of Separable Graphs. [Citation Graph (, )][DBLP]

  14. Implicit Hitting Set Problems and Multi-genome Alignment. [Citation Graph (, )][DBLP]

  15. Bounds on the Minimum Mosaic of Population Sequences under Recombination. [Citation Graph (, )][DBLP]

  16. The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection. [Citation Graph (, )][DBLP]

  17. Phylogeny- and Parsimony-Based Haplotype Inference with Constraints. [Citation Graph (, )][DBLP]

  18. Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks. [Citation Graph (, )][DBLP]

  19. Mod/Resc Parsimony Inference. [Citation Graph (, )][DBLP]

  20. Extended Islands of Tractability for Parsimony Haplotyping. [Citation Graph (, )][DBLP]

  21. Sampled Longest Common Prefix Array. [Citation Graph (, )][DBLP]

  22. Verifying a Parameterized Border Array in O(n1.5) Time. [Citation Graph (, )][DBLP]

  23. Cover Array String Reconstruction. [Citation Graph (, )][DBLP]

  24. Compression, Indexing, and Retrieval for Massive String Data. [Citation Graph (, )][DBLP]

  25. Building the Minimal Automaton of A*X in Linear Time, When X Is of Bounded Cardinality. [Citation Graph (, )][DBLP]

  26. A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach. [Citation Graph (, )][DBLP]

  27. Algorithms for Three Versions of the Shortest Common Superstring Problem. [Citation Graph (, )][DBLP]

  28. Finding Optimal Alignment and Consensus of Circular Strings. [Citation Graph (, )][DBLP]

  29. Optimizing Restriction Site Placement for Synthetic Genomes. [Citation Graph (, )][DBLP]

  30. Extension and Faster Implementation of the GRP Transform for Lossless Compression. [Citation Graph (, )][DBLP]

  31. Parallel and Distributed Compressed Indexes. [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