
	Where results make sense

Topic: Subsequence

In the News (Tue 2 Dec 08)

Damian Green

Sumner Redstone

Crimson Tide

Tommy Tuberville

Bill Clinton

Wayne Rooney

Vilasrao Deshmukh

Wake Forest

Grand Slam

Oklahoma State

	Subsequence - Wikipedia, the free encyclopedia
		In mathematics, a subsequence of some sequence is a new sequence which is formed from the original sequence by deleting some of the elements without disturbing the relative positions of the remaining elements.
		Subsequences have applications to computer science, especially in the discipline of Bioinformatics, where computers are used to compare, analyze, and store DNA strands.
		Subsequences are used to determine how similar the two strands of DNA are, using the DNA bases: adenine, guanine, cytosine and thymine.
	en.wikipedia.org /wiki/Subsequence (311 words)

	Longest increasing subsequence problem - Wikipedia, the free encyclopedia
		Though this is asymptotically equivalent to the longest common subsequence version of the solution, the constant is lower, as there is less overhead.
		In this case the last number of the subsequence is replaced by the new number.
		The number is greater than the last number of the subsequence: The number is appended to the subsequence and if this subsequence is the best subsequence with this length, it will be stored.
	en.wikipedia.org /wiki/Longest_increasing_subsequence_problem (415 words)

	Longest Common Subsequence
		Given that the subsequence is common to both sequences, the x and y axis are interchangable.
		At the end of the algorithm, the length of the subsequence is then given by the right most value in last row.
		The calculation of the Subsequence and the Length of the Subsequence.
	freespace.virgin.net /cdm.henderson/site/cpp/lcs (617 words)

	Longest Common Subsequences
		It works by finding a longest common subsequence of the lines of the two files; any line in the subsequence has not been changed, so what it displays is the remaining set of lines that have changed.
		It is possible to view the computation of the minimum length sequence of characters needed to update the terminal as being a sort of common subsequence problem (the common subsequence tells you the parts of the display that are already correct and don't need to be changed).
		The current (theoretically) fastest algorithm for longest common subsequences (due to myself and co-authors) runs in time O(n log s + c log log min(c,mn/c)) where c is the number of these corners, and s is the number of characters appearing in the two strings.
	www.ics.uci.edu /~eppstein/161/960229.html (2866 words)

	Subsequence References: First-Class Values for Substrings
		Subsequences can be viewed as a generalization of Icon's andpos and andsubject; however subsequences can appear in any context, not just within string scanning.
		A subsequence reference or subseq is a triple [b, l, r] where b is a sequence and l and r are positions in b.
		Operations on subsequence references are most succinctly implemented by modifying their argument, so, in an applicative environment, the code compiled to pass a subseq as an argument copies its value.
	www.cs.cmu.edu /~wjh/papers/subseq.html (6376 words)

	The minimal longest ascending subsequence algorithm
		It follows that, for any given subsequence length, there is a minimal ascending subsequence which is less than all other subsequences with the same same length.
		An ascending subsequence of length m is a longest ascending subsequence.
		In all of these cases the subsequences for n+1 are the same as those for n except for the one containing x[n].
	home.tiac.net /~cri/2001/mlas.html (655 words)

	CriticalSenses - SubSequence (Site not responding. Last check: 2007-10-31)
		SubSequence is a radio show hosted by Somaya Langley and Sam Karmel and broadcast across the Australian Community Radio Network.
		SubSequence commenced in the mid '90s, during the days when Clan Analogue maintained a healthy existance in Canberra.
		SubSequence is looking for new, unpublished or published electronic music and sound works by Australian creators.
	www.criticalsenses.com /subsequence (248 words)

	Problem H - Maximum Subsequence
		You are given a sequence of N integers, each of which is not greater than 10,000 considering absolute value.
		You have to pick such a subsequence, so that multiplication of all its integers is maximum.
		For each set of input print in a single line the summation of the integers in the desired subsequence.
	acm.uva.es /p/v107/10747.html (165 words)

	Finding the Longest Nondecreasing Subsequence of A Given Sequence (Site not responding. Last check: 2007-10-31)
		By definition, an increasing subsequence is also a monotonic subsequence.
		The recursion stops when the index hits the end of the sequence, otherwise it decides if the current index can be included, then takes the maximum of not including it (thus preserving the old lower bound) and electing to include it.
		When iteration is finished we simply mark the entries in a corresponding boolean array for each used entry and then parse the bitmap forwards separately to generate the actual subsequence.
	www.cis.ksu.edu /~jld5445/575experiment.html (1645 words)

	SubSequence
		Represents two sequences of long values where one sequence is a subsequence of the other.
		Returns true if the two original variables are related in a way that makes subsequence or subset detection not informative.
		Return true if both invariants are the same class and the order of the variables (swap) is the same.
	pag.csail.mit.edu /daikon/download/jdoc/daikon/inv/binary/twoSequence/SubSequence.html (518 words)

	Bit-String Longest Common Subsequence LCS Algorithm
		For example, using the alphabet A, C, G and T of genetic bases, an LCS of 'GCTAT' and 'CGATTA' is 'GTT' of length three.
		Bounds on the complexity of the longest common subsequence problem.
		A longest common subsequence algorithm suitable for similar text strings.
	www.csse.monash.edu.au /~lloyd/tildeStrings/Alignment/86.IPL.html (1942 words)

	longest common subsequence (Site not responding. Last check: 2007-10-31)
		Definition: The problem of finding a maximum length (or maximum weight) subsequence of two or more strings.
		Note: The longest common substring is contiguous, while the longest common subsequence need not be.
		Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "longest common subsequence", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology.
	www.nist.gov /dads/HTML/longestCommonSubsequence.html (150 words)

	Dr. Dobb's \| <algorithm>: find_end \| October 31, 2005
		You'll note that subsequence is of the type boost::array [3], which is a simple wrapper class around arrays that makes it possible to treat arrays almost like STL containers.
		The binary predicate is used to test each element in subsequence, and all comparisons must return true for the algorithm to return an iterator to the beginning of that range.
		Had that not been the case, you would have used search() together with a subsequence that also would need to be reversed when searching, or else the only match you could possibly get would be one for the subsequence backwards.
	www.ddj.com /dept/cpp/184402019 (2754 words)

	[No title]
		The contents of a subsequence are undefined after any destructive // operation upon the source sequence.
		Destructive operations upon subsequences may be reflected in the // source.
		The implementation tries to insure that subsequences of subsequences // can be accessed as efficiently as the original subsequence.
	www.cs.cmu.edu /afs/cs.cmu.edu/project/gwydion-4/OldFiles/panda/d2c/runtime/coll-ext/subseq.dylan (946 words)

	Longest Common Subsequence -- from Mathematica Information Center
		Finds the longest common subsequence in two lists (or two strings).
		For example: Both b, a, c and a, b, c are subsequences of the list a, c, b, d, a, c.
		And the longest common subsequence of a, c, d, b, a, c and p, c, d, b, d, c is c, d, b, c
	library.wolfram.com /infocenter/MathSource/5025 (94 words)

	Program VII - Longest Common Subsequence
		If str1.charAt(0) equals str2.charAt(0), then the length of a longest common subsequence of str1 and str2 is 1 more than the length of a longest common subsequence of str1.substring(1) and str2.substring(1).
		The length of a longest common subsequence is 9.
		The length of a longest common subsequence is 5.
	www.math.luc.edu /~ajs/courses/170sp99/program7.html (330 words)

	Longest Increasing Subsequence - Algorithmist
		A simple way of finding the longest increasing subsequence is to use the Longest Common Subsequence (Dynamic Programming) algorithm.
		Use Longest Common Subsequence on with A and B.
		+ 1 would simply be the longest of the longest subsequence from a
	www.algorithmist.com /index.php/Longest_Increasing_Subsequence (362 words)

	Math Forum Discussions (Site not responding. Last check: 2007-10-31)
		>there exists a subsequence {x_n_k} of {x_n} such that {x_n_k} does not
		>subsequence, by definition it is monotone and it is contained in {x_n}
		subsequence of {x_n}, then you could use my generaliztion of your statement
	mathforum.org /kb/thread.jspa?threadID=54205&messageID=204623 (255 words)

	Dr. Dobb's \| <algorithm>: find_end \| October 31, 2005 (Site not responding. Last check: 2007-10-31)
		The first form of search() expects four arguments: an iterator first1 to the first element of the sequence to search, an iterator last1 to the last element of the sequence, an iterator first2 to the first element of the subsequence to find, and an iterator end2 to the last element of the subsequence to find.
		The first form of find_end() expects four arguments: an iterator first1 to the first element of the sequence to search, an iterator last1 to the last element of the sequence, an iterator first2 to the first element of the subsequence to find, and an iterator end2 to the last element of the subsequence to find.
		Figure 1 demonstrates how the subsequence is matched against the full sequence.
	www.ddj.com /184402019?pgno=1 (2735 words)

	Math Forum Discussions (Site not responding. Last check: 2007-10-31)
		> >convergent subsequence whose limit is not x.
		> this subsequence of the subsequence cannot converge
		Doesn't the subsequence of the subsequence have to
	mathforum.org /kb/thread.jspa?threadID=1312855&messageID=4144769 (405 words)

	Bioinformatics and Genomics: Homework #10
		Subsequence Analysis (9-13 to 9-17 and 17-13 to 17-14)
		For the Subsequence analysis you must select the Class Subsequence File from within the Subsequence Analysis window.
		That is, give some indication of the accuracy of the analysis in terms of correct sites identified, and false positives and negatives using the gene and cDNA alignment as a reference.
	www.library.csi.cuny.edu /~davis/Bio_326/assignments/assign10.htm (607 words)

	Longest Common Subsequence
		Given sequences X and Y, Z is a common subsequence if Z is a subsequence to both X and Y. If Z is the longest possible subsequence of both X and Y then it is the longest common subsequence.
		a common subsequence is < G, C, A > also < G, C, G, A >, < G, T, A, G > and < G, C, A, G >, since no common subsequence of length 5 exists there are 2 LCS's: < G, C, G, A > and < G, T, A, G >.
		Could enumerate all subsequences of X (length m)
	www.cs.fsu.edu /~cop4531/slideshow/chapter16/16-3.html (360 words)

	subsequence - OneLook Dictionary Search
		subsequence, subsequence : Encarta® World English Dictionary, North American Edition [home, info]
		Phrases that include subsequence: longest common subsequence, longest common subsequence problem, lower-trimmed subsequence
		Words similar to subsequence: posteriority, sequel, subsequentness, more...
	www.onelook.com /?w=subsequence (166 words)

	Problem C: Longest Common Subsequence (Site not responding. Last check: 2007-10-31)
		Given two sequences of characters, print the length of the longest common subsequence of both sequences.
		For example, the longest common subsequence of the following two sequences:
		For each subsequent pair of input lines, output a line containing one integer number which satisfies the criteria stated above.
	acm.uva.es /p/v104/10405.html (87 words)

	TestStand Asynchronous Subsequence Execution - Example - National Instruments
		This example demonstrates asynchronous subsequence execution in TestStand.
		This solution launches a subsequence that executes asynchronously in a separate thread, this allows the testing sequence to continue to execute other tests simultaneously.
		This code is supported by National Instruments, but may not be completely tested and verified with each new revision of related products and drivers.
	sine.ni.com /apps/we/niepd_web_display.display_epd4?p_guid=B45EACE3DC7D56A4E034080020E74861&p_node=< (136 words)

	Maximum Subsequence Sum (Site not responding. Last check: 2007-10-31)
		Algorithms: A Top-Down Approach (R. Howell) describes five algorithms for solving the maximum subsequence sum problem, and reports the results of timing tests of implementations of each of them.
		Maximum subsequence sum is 485 Time: 0.0030 seconds
		Sun, Sun Microsystems, the Sun Logo, and Java are trademarks or registered trademarks of Sun Microsystems, Inc. in the United States and other countries.
	www.cis.ksu.edu /~rhowell/algorithms-text/maxsum (185 words)

	SchemaDoc: Subsequence (Site not responding. Last check: 2007-10-31)
		Multiple Subsequences can make up a given NucleicAcid entry.
		Todo: Currently the schema has no way of indicating an approximate position of this Subsequence on the NucleicAcid as a whole.
		Dataset-specific information to indicate the version of this Subsequence.
	bioinformatics.ai.sri.com /biowarehouse/repos/schema/doc/mysql/Subsequence.html (151 words)

	Longest Common Subsequence (Site not responding. Last check: 2007-10-31)
		This applet shows the dynamic programming table for the longest common subsequence algorithm described in the book Introduction to Algorithms by Cormen, Leiserson and Rivest.
		Just edit the two textfields at the bottom (remember you have to press Return to generate the appropriate action event) to compute the LCS of any two strings you like.
		Currently has a fixed maximum length of 15 for each string.
	ranger.uta.edu /~cook/aa/lectures/applets/lcs/lcs.html (66 words)

	Maximum contiguous subsequence sum
		Given: a (one-dimensional) array A of integers, of length n
		Find: the start and end indices and sum value for that subsequence A[i]...
		A[j] which has the maximum sum relative to all such (contiguous) subsequences
	www.willamette.edu /~fruehr/dsa/lectures/examples0.html (80 words)

	Redasoft Visual Cloning - Subsequence Search (Site not responding. Last check: 2007-10-31)
		The Subsequence Search tool will find a specified subsequence of interest in your sequence.
		Choose to search the entire sequence of your map or a specific region.
		You can display all or a selection of the subsequences on the map to get a better idea of where they are located.
	www.redasoft.com /vc2000/subsequence.htm (67 words)

	Subsequence.java (Site not responding. Last check: 2007-10-31)
		Below is the syntax highlighted version of Subsequence.java from §3.1 Using Data Types.
		* Determines whether string s is a subsequence of string t.
		Last updated: Wed Feb 9 18:29:01 EST 2005.
	www.cs.princeton.edu /introcs/31datatype/Subsequence.java.html (40 words)

Try your search on: Qwika (all wikis)