The String-to-String Correction Problem
Journal of the ACM (JACM)
An Extension of the String-to-String Correction Problem
Journal of the ACM (JACM)
Bounds on the Complexity of the Longest Common Subsequence Problem
Journal of the ACM (JACM)
Bounds for the String Editing Problem
Journal of the ACM (JACM)
A linear space algorithm for computing maximal common subsequences
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
On the complexity of the Extended String-to-String Correction Problem
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
STRING-MATCHING AND OTHER PRODUCTS
STRING-MATCHING AND OTHER PRODUCTS
Selected combinatorial research problems.
Selected combinatorial research problems.
The longest common subsequence problem.
The longest common subsequence problem.
ACM Transactions on Programming Languages and Systems (TOPLAS)
New algorithms for comparing symbol sequences
ACM '87 Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow
An efficient algorithm for pattern detection and classification
IEA/AIE '88 Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 2
Scheduling high-level blocks for functional simulation
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
The complexity of querying indefinite data about linearly ordered domains
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Numerical Similarity and Dissimilarity Measures Between Two Trees
IEEE Transactions on Computers
On the approximation of protein threading
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Deadlock-free routing in arbitrary networks via the flattest common supersequence method
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Motif discovery without alignment or enumeration (extended abstract)
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
Randomness of finite strings: a reconstructive approach
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
An approximation algorithm for the shortest common supersequence problem: an experimental analysis
Proceedings of the 2001 ACM symposium on Applied computing
Approximation algorithms for the shortest common supersequence
Nordic Journal of Computing
Compactness and Learning of Classes of Unions of Erasing Regular Pattern Languages
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Approximate Periods of Strings
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Eliminating Useless Parts in Semi-structured Documents Using Alternation Counts
DS '01 Proceedings of the 4th International Conference on Discovery Science
Analogs and Duals of teh MAST Problem for Sequences and Trees
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
An approximate A* algorithm and its application to the SCS problem
Theoretical Computer Science
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Visualizing Biosequence Data Using Texture Mapping
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
Part Batching and Scheduling in a Flexible Cell to Minimize Setup Costs
Journal of Scheduling
The consensus string problem for a metric is NP-complete
Journal of Discrete Algorithms
On the complexity of finding common approximate substrings
Theoretical Computer Science
On Precision and Recall of Multi-Attribute Data Extraction from Semistructured Sources
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
On the complexity of schema inference from web pages in the presence of nullable data attributes
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
The constrained longest common subsequence problem
Information Processing Letters
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
On the complexity of permutation network design
ACM SIGACT News
A simple algorithm for the constrained sequence problems
Information Processing Letters
Combined super-/substring and super-/subsequence problems
Theoretical Computer Science
About the design of oligo-chips
Discrete Applied Mathematics - Ordinal and symbolic data analysis (OSDA 2000)
Pattern Identification in Biogeography
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Longest common subsequence problem for unoriented and cyclic strings
Theoretical Computer Science
Dynamic programming algorithms for the mosaic longest common subsequence problem
Information Processing Letters
Mining minimal distinguishing subsequence patterns with gap constraints
Knowledge and Information Systems
Multiple genome rearrangement by swaps and by element duplications
Theoretical Computer Science
Exemplar Longest Common Subsequence
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Efficient algorithms for finding interleaving relationship between sequences
Information Processing Letters
New efficient algorithms for the LCS and constrained LCS problems
Information Processing Letters
Comparing bacterial genomes from linear orders of patterns
Discrete Applied Mathematics
Finding the longest common subsequence for multiple biological sequences by ant colony optimization
Computers and Operations Research
Algorithms for computing variants of the longest common subsequence problem
Theoretical Computer Science
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
Constrained LCS: Hardness and Approximation
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
On the Longest Common Parameterized Subsequence
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Learning Languages from Bounded Resources: The Case of the DFA and the Balls of Strings
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Prediction of Protein Beta-Sheets: Dynamic Programming versus Grammatical Approach
PRIB '08 Proceedings of the Third IAPR International Conference on Pattern Recognition in Bioinformatics
Some Approximations for Shortest Common Nonsubsequences and Supersequences
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Approximation Algorithms for Optimal RNA Secondary Structures Common to Multiple Sequences
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Beam search for the longest common subsequence problem
Computers and Operations Research
Towards Trajectory Anonymization: a Generalization-Based Approach
Transactions on Data Privacy
Finding the longest common nonsuperstring in linear time
Information Processing Letters
Improved Approximation Results on the Shortest Common Supersequence Problem
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
On the longest common parameterized subsequence
Theoretical Computer Science
Disjoint pattern matching and implication in strings
Information Processing Letters
A subsequence-histogram method for generic vocabulary recognition over deletion channels
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
About the design of oligo-chips
Discrete Applied Mathematics - Ordinal and symbolic data analysis (OSDA 2000)
Finite automata based algorithms on subsequences and supersequences of degenerate strings
Journal of Discrete Algorithms
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Complexities of the centre and median string problems
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Probabilistic beam search for the longest common subsequence problem
SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
Finding common structured patterns in linear graphs
Theoretical Computer Science
Parameterized complexity and approximability of the SLCS problem
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Deep hypertext with embedded revision control implemented in regular expressions
Proceedings of the 6th International Symposium on Wikis and Open Collaboration
Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem
Fundamenta Informaticae
Variants of constrained longest common subsequence
Information Processing Letters
Cache-Oblivious Dynamic Programming for Bioinformatics
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Perturbation-based user-input-validation testing of web applications
Journal of Systems and Software
The complexity of flood filling games
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
A parallel longest common subsequence algorithm in UPC
SpringSim '10 Proceedings of the 2010 Spring Simulation Multiconference
A hybrid metaheuristic for the longest common subsequence problem
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Variable compression in ProbLog
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Efficient pattern matching algorithm for memory architecture
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Information Sciences: an International Journal
On the generalized constrained longest common subsequence problems
Journal of Combinatorial Optimization
An improved algorithm for the longest common subsequence problem
Computers and Operations Research
Restricted common superstring and restricted common supersequence
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Finding shuffle words that represent optimal scheduling of shared memory access
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Weighted shortest common supersequence
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
LogSig: generating system events from raw textual logs
Proceedings of the 20th ACM international conference on Information and knowledge management
Starting from scratch: growing longest common subsequences with evolution
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Efficient algorithms for finding a longest common increasing subsequence
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On the parameterized complexity of the repetition free longest common subsequence problem
Information Processing Letters
On the longest common rigid subsequence problem
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
An enhanced beam search algorithm for the Shortest Common Supersequence Problem
Engineering Applications of Artificial Intelligence
Approximability of constrained LCS
Journal of Computer and System Sciences
Some applications of string algorithms in human-computer interaction
Algorithms and Applications
Exemplar longest common subsequence
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
Fast algorithms for computing the constrained LCS of run-length encoded strings
Theoretical Computer Science
The computation of consensus patterns in DNA sequences
Mathematical and Computer Modelling: An International Journal
A bibliography on computational molecular biology and genetics
Mathematical and Computer Modelling: An International Journal
Predicting the types of file fragments
Digital Investigation: The International Journal of Digital Forensics & Incident Response
Parameterized complexity and approximability of the Longest Compatible Sequence problem
Discrete Optimization
Charge and reduce: A fixed-parameter algorithm for String-to-String Correction
Discrete Optimization
Quick-MLCS: a new algorithm for the multiple longest common subsequence problem
Proceedings of the Fifth International C* Conference on Computer Science and Software Engineering
Hardness of longest common subsequence for sequences with bounded run-lengths
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Common structured patterns in linear graphs: approximation and combinatorics
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Algorithms for computing the longest parameterized common subsequence
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Longest common separable pattern among permutations
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Comparing multiobjective swarm intelligence metaheuristics for DNA motif discovery
Engineering Applications of Artificial Intelligence
Unsupervised temporal commonality discovery
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part IV
Computing longest common subsequences with the B-cell algorithm
ICARIS'12 Proceedings of the 11th international conference on Artificial Immune Systems
Proceedings of the 28th Annual ACM Symposium on Applied Computing
The constrained shortest common supersequence problem
Journal of Discrete Algorithms
Minimizing accumulative memory load cost on multi-core DSPs with multi-level memory
Journal of Systems Architecture: the EUROMICRO Journal
Efficient separability of regular languages by subsequences and suffixes
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
A ternary unification framework for optimizing TCAM-based packet classification systems
ANCS '13 Proceedings of the ninth ACM/IEEE symposium on Architectures for networking and communications systems
A parallel cooperative team of multiobjective evolutionary algorithms for motif discovery
The Journal of Supercomputing
| Hi-index | 0.02 |