 |
Fakultät für Informatik - Technische Universität MünchenLehrstuhl für Effiziente Algorithmen |
 |
Die bibliographische Datenbank LEABib
Suchen •
Liste der Journale •
Liste der Serien •
Liste der Konferenzen •
Ausgewählte Publikationen 
|
Hilfe 
|
 |
|
| Suche: Citkey="Nicolas-Rivals/07" |
|
Longest common subsequence problem for unoriented and cyclic strings
François Nicolas, Eric Rivals
Theoretical Computer Science 370 (1-3), 2007, pp. 1-18
| Editors | G. Ausiello, D. Sannella | |
| Publisher: | Elsevier B.V. | |
| Address: | Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis | |
| Keywords: | longest common subsequence, lcs, cyclic string, sequence comparison, pattern recognition, graph, hypergraph, maximum stable set, maximum independent set, approximation, parameterized complexity, -hard, -hard | |
| URL: |
http://www.sciencedirect.com/science/article/B6V1G-4M4KDMX-1/2/9b93f5e53f4983a14d0cb41e53b338c8 | |
|
|
|
|