IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, VOL. 32, NO. 3,

First Page		Document Content
Date: 2006-03-02 16:01:29 Anti-patterns User interface techniques Duplicate code Source code Plagiarism detection Cut copy and paste Substring Subsequence Software versioning Computer programming Software engineering Computing		IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, VOL. 32, NO. 3, Add to Reading List Source URL: pages.cs.wisc.edu Download Document from Source Website File Size: 2,00 MB Share Document on Facebook

	Permutations with short monotone subsequences Dan Romik Abstract We consider permutations of 1, 2, ..., n2 whose longest monotone subsequence is of length n and are therefore extremal for the Erd˝ os-Szekeres theorem. S DocID: 1tIki - View Document
	On Distance to Monotonicity and Longest Increasing Subsequence of a Data Stream Funda Ergun∗ Abstract In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of DocID: 1tj48 - View Document
	Exemplar Longest Common Subsequence Paola Bonizzoni1 , Gianluca Della Vedova2 , Riccardo Dondi1 , Guillaume Fertin3 , and St´ephane Vialette4 1 Dipartimento di Informatica, Sistemistica e Comunicazione, Universit` DocID: 1szIp - View Document
	Noisy FAQ Retrieval Using Longest Common Subsequence Problem Pooja Porwal Aman Jain DocID: 1rVQe - View Document
	Approximating Border Length for DNA Microarray Synthesis Cindy Y. Li1 Prudence W.H. Wong1 Qin Xin2 Fencol C.C. Yung3 1 3 DocID: 1rszu - View Document