Packaged: Tue Apr 10 23:17:36 2007; hornik

Packaged: Sat Apr 14 21:22:57 2007; larman

Title: Cairo-based cross-platform antialiased graphics device driver.
Description: Cairo/GTK graphics device driver with output to screen,
file (png, svg, pdf, and ps) or memory (arbitrary GdkDrawable
or Cairo context). The screen device may be embedded into RGtk2
interfaces. Supports all interactive features of other graphics
Acknowledgements: Lyndon Drake (based on gtkDevice), Brian Ripley
(updates for R 2.7), Mikhail Kondrin (Adobe->UTF8 translation)
Packaged: Wed Mar 25 15:08:30 2009; larman

(updates for R 2.7), Mikhail Kondrin (Adobe->UTF8 translation),

Title: Cairo-based Graphics Device Driver
Description: This device uses Cairo and GTK to draw to the screen,
interfaces and supports all interactive features of other graphics

Title: Embeddable Cairo Graphics Device Driver

Packaged: Thu Jun 21 20:54:35 2007; larman

file (png, svg, pdf, and ps) or memory (GdkDrawable). The screen device
may be embedded into RGtk2 interfaces. Supports all interactive features
of other graphics devices, including getGraphicsEvent().
Acknowledgements: Mikhail Kondrin (Adobe->UTF8 translation)
Packaged: Fri Sep 28 19:29:23 2007; larman

Packaged: Wed Mar  5 08:33:10 2008; ripley

Packaged: Thu Jan 17 12:41:20 2008; larman

Acknowledgements: Lyndon Drake (based on gtkDevice),
Brian Ripley (updates for R 2.7), Mikhail Kondrin (Adobe->UTF8 translation)
Packaged: Tue Apr 29 14:28:07 2008; larman

Packaged: Tue Oct  7 05:17:16 2008; larman

Packaged: Tue Oct  7 07:50:18 2008; larman

Description: Count all common subsequences between 2 string sequences, with
items separated by the same delimiter. The first string input is a length-
one vector, the second string input can be a vector or list containing
multiple strings. Algorithm from Wang, H. All common subsequences (2007) IJCAI
International Joint Conference on Artificial Intelligence, pp. 635-640.

multiple strings. The algorithm differentiates between the more strict
definition of subsequence, where a common subsequence cannot be separated
by any other items, from its looser counterpart, where a common subsequence
can be interrupted by other items. For example, q-w is a common subsequence
of q-w-e-r and q-e-w-r on the looser definition, but not the more strict
definition. calACSLoose Algorithm from Wang, H. All common subsequences
(2007) IJCAI International Joint Conference on Artificial Intelligence, pp. 635-640.