Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Fraser, Campbell B."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Maximal common subsequences and minimal common supersequences
Campbell B. Fraser
,
Robert W. Irving
,
Martin Middendorf
Information and Computation
124
(2), 1996, pp. 145-153
Maximal common subsequences and minimal common supersequences
Robert W. Irving
,
Campbell B. Fraser
Lecture Notes in Computer Science
807
, 1994, pp. 173-183
On the worst-case behaviour of some approximation algorithms for the shortest common supersequence of
k
strings
Robert W. Irving
,
Campbell B. Fraser
Lecture Notes in Computer Science
684
, 1993, pp. 63-73
Two algorithms for the longest common subsequence of three (or more) strings
Robert W. Irving
,
Campbell B. Fraser
Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching, CPM'92 (Tuscon, Arizona, USA, April 29 - May 1, 1992)
644
, 1992, pp. 214-229