Amanote Research
Register
Sign In
An Efficient Algorithm for LCS Problem Between Two Arbitrary Sequences
Mathematical Problems in Engineering
- Egypt
doi 10.1155/2018/4158071
Full Text
Open PDF
Abstract
Available in
full text
Categories
Mathematics
Engineering
Date
November 29, 2018
Authors
Yubo Li
Publisher
Hindawi Limited
Related search
An Efficient Two-Phase Metaheuristic Algorithm for the Time Dependent Traveling Salesman Problem
RAIRO - Operations Research
Management Science
Computer Science Applications
Operations Research
Theoretical Computer Science
An Efficient Algorithm for Generating Assembly Sequences in Modification Design.
Seimitsu Kogaku Kaishi/Journal of the Japan Society for Precision Engineering
Mechanical Engineering
An Efficient Algorithm for Solving a Stochastic Location-Routing Problem
Journal of Mathematics and Computer Science
Computational Mechanics
Computational Mathematics
Computer Science Applications
Mathematics
A New Pivoting Algorithm for the Linear Complementarity Problem Allowing for an Arbitrary Starting Point
Mathematical Programming, Series B
Mathematics
Software
An Efficient Imperialist Competitive Algorithm for Solving the QFD Decision Problem
Mathematical Problems in Engineering
Mathematics
Engineering
An Efficient Meta-Heuristic Algorithm for Solving Capacitated Vehicle Routing Problem
International Journal of Advances in Intelligent Informatics
Computer Vision
Pattern Recognition
Human-Computer Interaction
Artificial Intelligence
The Diagonal-Traverse Homology Search Algorithm for Locating Similarities Between Two Sequences
Nucleic Acids Research
Genetics
An Efficient Two-Scan Labeling Algorithm for Binary Hexagonal Images
IEICE Transactions on Information and Systems
Electronic Engineering
Pattern Recognition
Hardware
Computer Vision
Electrical
Architecture
Artificial Intelligence
Software
An Efficient Algorithm for Padé-Type Approximation of the Frequency Response for the Helmholtz Problem
