Finding least common ancestors in directed acyclic graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On binary searching with non-uniform costs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Succinct representations of lcp information and improvements in the compressed suffix arrays
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate distance oracles for geometric graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Nearest common ancestors: a survey and a new distributed algorithm
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Optimal Range Max Datacube for Fixed Dimensions
ICDT '03 Proceedings of the 9th International Conference on Database Theory
An Optimal Algorithm for Finding NCA on Pure Pointer Machines
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Space-Efficient Data Structures for Flexible Text Retrieval Systems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
The Level Ancestor Problem Simplified
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Ancestor Problems on Pure Pointer Machines
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Approximating Geometric Bottleneck Shortest Paths
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Computing Highly Specific and Mismatch Tolerant Oligomers Efficiently
CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Unordered Tree Mining with Applications to Phylogeny
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
When indexing equals compression: experiments with compressing suffix arrays and applications
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Finding dominators revisited: extended abstract
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Replacing suffix trees with enhanced suffix arrays
Journal of Discrete Algorithms - SPIRE 2002
A fully dynamic reachability algorithm for directed graphs with an almost linear update time
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Constructing Suffix Tree for Gigabyte Sequences with Megabyte Memory
IEEE Transactions on Knowledge and Data Engineering
Approximating geometric bottleneck shortest paths
Computational Geometry: Theory and Applications
An O(N^2) Algorithm for Discovering Optimal Boolean Pattern Pairs
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Quasi-Linear Algorithms for the Topological Watershed
Journal of Mathematical Imaging and Vision
Efficient algorithms for substring near neighbor problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Lowest common ancestors in trees and directed acyclic graphs
Journal of Algorithms
Keyword Proximity Search in XML Trees
IEEE Transactions on Knowledge and Data Engineering
Sequential and parallel algorithms for the NCA problem on pure pointer machines
Theoretical Computer Science
Extracting key-substring-group features for text classification
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Range mode and range median queries on lists and trees
Nordic Journal of Computing
A new framework for addressing temporal range queries and some preliminary results
Theoretical Computer Science
Computing suffix links for suffix trees and arrays
Information Processing Letters
Succinct data structures for flexible text retrieval systems
Journal of Discrete Algorithms
All maximal-pairs in step-leap representation of melodic sequence
Information Sciences: an International Journal
Linear time algorithm for the longest common repeat problem
Journal of Discrete Algorithms
Journal of Discrete Algorithms
Multiway SLCA-based keyword search in XML data
Proceedings of the 16th international conference on World Wide Web
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
Theoretical Computer Science
Constructing pairwise disjoint paths with few links
ACM Transactions on Algorithms (TALG)
Approximate distance oracles for geometric spanners
ACM Transactions on Algorithms (TALG)
Faster index for property matching
Information Processing Letters
Balanced parentheses strike back
ACM Transactions on Algorithms (TALG)
Testing contractibility in planar rips complexes
Proceedings of the twenty-fourth annual symposium on Computational geometry
Algorithms for computing variants of the longest common subsequence problem
Theoretical Computer Science
Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees
Information Processing Letters
Optimal prefix and suffix queries on texts
Information Processing Letters
A Simple and Compact Algorithm for the RMQ and Its Application to the Longest Common Repeat Problem
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
A New Efficient Algorithm for Computing the Longest Common Subsequence
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
On the Evaluation of Large and Sparse Graph Reachability Queries
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem
WABI '08 Proceedings of the 8th international workshop on Algorithms in Bioinformatics
Information Processing Letters
The 2-radius and 2-radiian problems on trees
Theoretical Computer Science
An Ω(n^2/ log n) Speed-Up of TBR Heuristics for the Gene-Duplication Problem
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Dual-failure distance and connectivity oracles
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Efficient data structures for range-aggregate queries on trees
Proceedings of the 12th International Conference on Database Theory
Efficient asymmetric inclusion between regular expression types
Proceedings of the 12th International Conference on Database Theory
A Simple Algorithm for Finding Exact Common Repeats
IEICE - Transactions on Information and Systems
Hash-Search: An Efficient SLCA-Based Keyword Search Algorithm on XML Documents
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
From Gene Trees to Species Trees through a Supertree Approach
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
The Gene-Duplication Problem: Near-Linear Time Algorithms for NNI-Based Local Searches
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
XPath evaluation in linear time with polynomial combined complexity
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient inclusion for a class of XML types with interleaving and counting
Information Systems
Multidimensional data structures and techniques for efficient decision making
MCBE'09 Proceedings of the 10th WSEAS international conference on Mathematics and computers in business and economics
Engineering a compressed suffix tree implementation
Journal of Experimental Algorithmics (JEA)
Handling routability in floorplan design with twin binary trees
Integration, the VLSI Journal
Errata for “Faster index for property matching”
Information Processing Letters
Efficient Data Structures for the Orthogonal Range Successor Problem
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Practical Algorithms for the Longest Common Extension Problem
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
New compilation languages based on structured decomposability
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Linear inclusion for XML regular expression types
Proceedings of the 18th ACM conference on Information and knowledge management
Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
A scalable parallelization of the gene duplication problem
Journal of Parallel and Distributed Computing
Lowest common ancestors in trees and directed acyclic graphs
Journal of Algorithms
Linear-time construction of suffix arrays
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
On all-substrings alignment problems
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Heuristics for the gene-duplication problem: a Θ(n) speed-up for the local search
RECOMB'07 Proceedings of the 11th annual international conference on Research in computational molecular biology
Simple linear work suffix array construction
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A new elimination-based data flow analysis framework using annotated decomposition trees
CC'07 Proceedings of the 16th international conference on Compiler construction
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Engineering a compressed suffix tree implementation
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Unique lowest common ancestors in dags are almost as easy as matrix multiplication
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Efficient inclusion for a class of XML types with interleaving and counting
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Improved bounds for range mode and range median queries
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
The gene-duplication problem: near-linear time algorithms for NNI based local searches
ISBRA'08 Proceedings of the 4th international conference on Bioinformatics research and applications
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Locating multiple gene duplications through reconciled trees
RECOMB'08 Proceedings of the 12th annual international conference on Research in computational molecular biology
Performance guarantees for B-trees with different-sized atomic keys
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computing longest common substrings via suffix arrays
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Efficient indexing algorithms for one-dimensional discretely-scaled strings
Information Processing Letters
Fully-functional succinct trees
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
The longest common extension problem revisited and applications to approximate string searching
Journal of Discrete Algorithms
Efficient index for retrieving top-k most frequent documents
Journal of Discrete Algorithms
Efficient SLCA-based keyword search on XML databases: an iterative-skip approach
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part I
On space efficient two dimensional range minimum data structures
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Top-k ranked document search in general text databases
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Finding Patterns In Given Intervals
Fundamenta Informaticae
Fast approximation in subspaces by doubling metric decomposition
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Constructing the R* consensus tree of two trees in subcubic time
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Improved data structures for the orthogonal range successor problem
Computational Geometry: Theory and Applications
Linear-Time Algorithms for the Multiple Gene Duplication Problems
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Detecting highways of horizontal gene transfer
RECOMB-CG'10 Proceedings of the 2010 international conference on Comparative genomics
String retrieval for multi-pattern queries
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
The indexing for one-dimensional proportionally-scaled strings
Information Processing Letters
An Approximation Algorithm for the Noah's Ark Problem with Random Feature Loss
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Building species trees from larger parts of phylogenomic databases
Information and Computation
On the Equivalence Between Hierarchical Segmentations and Ultrametric Watersheds
Journal of Mathematical Imaging and Vision
The tree inclusion problem: In linear space and faster
ACM Transactions on Algorithms (TALG)
Faster query algorithms for the text fingerprinting problem
Information and Computation
A quick tour on suffix arrays and compressed suffix arrays
Theoretical Computer Science
XPath evaluation in linear time
Journal of the ACM (JACM)
Indexing Network Structure with Shortest-Path Trees
ACM Transactions on Knowledge Discovery from Data (TKDD)
A linear time algorithm for error-corrected reconciliation of unrooted gene trees
ISBRA'11 Proceedings of the 7th international conference on Bioinformatics research and applications
Fast local search for unrooted Robinson-foulds supertrees
ISBRA'11 Proceedings of the 7th international conference on Bioinformatics research and applications
Algorithms for rapid error correction for the gene duplication problem
ISBRA'11 Proceedings of the 7th international conference on Bioinformatics research and applications
Incremental algorithm for hierarchical minimum spanning forests and saliency of watershed cuts
ISMM'11 Proceedings of the 10th international conference on Mathematical morphology and its applications to image and signal processing
Succinct 2D dictionary matching with no slowdown
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Pattern matching in lempel-Ziv compressed strings: fast, simple, and deterministic
ESA'11 Proceedings of the 19th European conference on Algorithms
Approximate point set pattern matching with Lp-norm
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Compressed indexes for aligned pattern matching
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
A new efficient indexing algorithm for one-dimensional real scaled patterns
Journal of Computer and System Sciences
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Top-k document retrieval in optimal time and linear space
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Amortized rigidness in dynamic cartesian trees
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Theoretical and practical improvements on the RMQ-Problem, with applications to LCA and LCE
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Reconciling gene trees with apparent polytomies
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Sensitivity analysis of minimum spanning trees in sub-inverse-ackermann time
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Shortest non-crossing walks in the plane
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Optimal pattern matching in LZW compressed strings
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Ordered and unordered top-K range reporting in large data sets
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A modification of the landau-vishkin algorithm computing longest common extensions via suffix arrays
BSB'05 Proceedings of the 2005 Brazilian conference on Advances in Bioinformatics and Computational Biology
Efficient algorithms for three variants of the LPF table
Journal of Discrete Algorithms
On the range maximum-sum segment query problem
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
A fast longest common subsequence algorithm for similar strings
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Algorithms for computing variants of the longest common subsequence problem
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Linear time algorithm for the generalised longest common repeat problem
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
A non-iterative data-flow algorithm for computing liveness sets in strict SSA programs
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Fast algorithms for computing the constrained LCS of run-length encoded strings
Theoretical Computer Science
Contraction-based steiner tree approximations in practice
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Path queries in weighted trees
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Efficient algorithms for the weighted k-center problem on a real line
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Improved algorithms for the range next value problem and applications
Theoretical Computer Science
Efficient relaxed search in hierarchically clustered sequence datasets
Journal of Experimental Algorithmics (JEA)
Fast Local Search for Unrooted Robinson-Foulds Supertrees
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
An optimal data structure to handle dynamic environments in non-deterministic computations
Computer Languages, Systems and Structures
Research paper: The saga of minimum spanning trees
Computer Science Review
GTP supertrees from unrooted gene trees: linear time algorithms for NNI based local searches
ISBRA'12 Proceedings of the 8th international conference on Bioinformatics Research and Applications
A robinson-foulds measure to compare unrooted trees with rooted trees
ISBRA'12 Proceedings of the 8th international conference on Bioinformatics Research and Applications
Succinct ordinal trees based on tree covering
ACM Transactions on Algorithms (TALG)
Variations of the parameterized longest previous factor
Journal of Discrete Algorithms
Space-Efficient top-k document retrieval
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Document listing for queries with excluded pattern
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Cross-Document pattern matching
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Simple and efficient LZW-Compressed multiple pattern matching
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Linear-Space data structures for range minority query in arrays
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Connectivity oracles for planar graphs
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
An Ω(n2/ log n) speed-up of TBR heuristics for the gene-duplication problem
WABI'07 Proceedings of the 7th international conference on Algorithms in Bioinformatics
Finding patterns in given intervals
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Cache-oblivious index for approximate string matching
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Space-efficient algorithms for document retrieval
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Succinct ordinal trees based on tree covering
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Linear time algorithms for two disjoint paths problems on directed acyclic graphs
Theoretical Computer Science
Data structures for detecting rare variations in time series
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II
DTD based costs for tree-edit distance in structured information retrieval
ECIR'13 Proceedings of the 35th European conference on Advances in Information Retrieval
Optimal Pattern Matching in LZW Compressed Strings
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
Faster and smaller inverted indices with treaps
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
Computing weight constraint reachability in large networks
The VLDB Journal — The International Journal on Very Large Data Bases
Almost-linear inclusion for XML regular expression types
ACM Transactions on Database Systems (TODS)
Spaces, Trees, and Colors: The algorithmic landscape of document retrieval on sequences
ACM Computing Surveys (CSUR)
Top-K nearest keyword search on large graphs
Proceedings of the VLDB Endowment
A scalable approach to computing representative lowest common ancestor in directed acyclic graphs
Theoretical Computer Science
Compressed property suffix trees
Information and Computation
Cross-document pattern matching
Journal of Discrete Algorithms
One-dimensional approximate point set pattern matching with Lp-norm
Theoretical Computer Science
On the generalized multiway cut in trees problem
Journal of Combinatorial Optimization
Journal of Discrete Algorithms
Simple and efficient LZW-compressed multiple pattern matching
Journal of Discrete Algorithms
| Hi-index | 0.01 |