Conference Paper

A survey of longest common subsequence algorithms

Dept. of Comput. Sci., Turku Univ.;
DOI: 10.1109/SPIRE.2000.878178 Conference: String Processing and Information Retrieval, 2000. SPIRE 2000. Proceedings. Seventh International Symposium on
Source: IEEE Xplore

ABSTRACT The aim of this paper is to give a comprehensive comparison of well-known longest common subsequence algorithms (for two input strings) and study their behaviour in various application environments. The performance of the methods depends heavily on the properties of the problem instance as well as the supporting data structures used in the implementation. We want to make also a clear distinction between methods that determine the actual lcs and those calculating only its length, since the execution time and more importantly, the space demand depends crucially on the type of the task. To our knowledge, this is the first time this kind of survey has been done. Due to the page limits, the paper gives only a coarse overview of the performance of the algorithms; more detailed studies are reported elsewhere

1 Bookmark
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Recently, one of the received attraction fields in web based service is 'Human Relationship Service' that is called SNS. This relationship map service is able to deliver information to user more easily and visually because it is intuitive data that is linked with offline real world. While past map service put physical real information in the map, present map service is evolving into new communicative platform that expresses social relationship beyond simple search platform that shows real world. In this paper, we propose smart social grid system using sketch map that is based on online map service structure. This system has features such as standardized interface provision for various SNS, use to governance hub tool in case of establishing a personal network through expanded social grid, a role of bridge to mashup software linked with other SNS, user environment construction that reproduces social grid data, and the faster service setup by improved search technology.
    Journal of Korea Multimedia Society. 01/2012; 15(3).
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We present a novel methodology for deriving fine-grained patches of Java software. We consider an abstract-syntax tree (AST) representation of Java classes compiled to the Java Virtual Machine (JVM) format, and a difference analysis over the AST representation to de-rive patches. The AST representation defines an appro-priate abstraction level for analyzing differences, yield-ing compact patches that correlate modularly to actual source code changes. The approach contrasts to other common, coarse-grained approaches, like plain binary differences, which may easily lead to disproportionately large patches. We present the main traits of the method-ology, a prototype tool called aspa that implements it, and a case-study analysis on the use of aspa to derive patches for the Java 2 SE API. The case-study results il-lustrates that aspa patches have a significantly smaller size than patches derived by binary differencing tools.
    HotSWUp'13: 5th International Workshop on Hot Topics in Software Upgrades,, USENIX'13, San Jose, CA; 01/2013
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The service that has recently come into the spotlight utilizes the map to first approach the map and then provide various mash-up formed results through the interface. This service can provide precise information to the users but the map is barely reusable. The sketch-map system of this paper, unlike the existing large map system, uses the method of presenting the specific spot and route in XML document and then clustering among sketch-maps. The map service system is designed to show the optimum route to the destination in a simple outline map. It is done by renovating the spot presented by the map into optimum contents. This service system, through the process of analyzing, splitting and clustering of the sketch-map's XML document input, creates a valid form of a sketch-map. It uses the LCS(Longest Common Subsequence) algorithm for splitting and merging sketch-map in the process of query. In addition, the simulation of this system's expected effects is provided. It shows how the maps that share information and knowledge assemble to form a large map and thus presents the system's ability and role as a new research portal.
    The Journal of the Korea Contents Association. 01/2009; 9(12).


Available from