A Hybrid Genetic Algorithm for the Repetition Free Longest Common Subsequence Problem

AuthID
 P-008-ED6
3
Author(s)
Document Type
Article
Year published
2013
Published
in OPERATIONS RESEARCH LETTERS, ISSN: 0167-6377
Volume: 41, Issue: 6, Pages: 644-649 (6)
Indexing
Wos®
Scopus®
Crossref®
Google Scholar®
Publication Identifiers
SCOPUS: 2-s2.0-84884601178
Wos: WOS:000329010000018
Source Identifiers
ISSN: 0167-6377
Export Publication Metadata
Marked List
 Add to Marked List
Info
At this moment we don't have any links to full text documens.

A place for researchers and their institutions

Useful Links

Get Help

© 2024 CRACS & Inesc TEC - All Rights Reserved Privacy Policy | Terms of Service