
	Where results make sense

Topic: Lowest common ancestor

	Month Year Issue
		Common ancestor node C is derived from D and E nodes.
		It is located under common ancestor node A node which is derived from B node and C node’s sub result of D and E. This requires nested common ancestor processing of C under A node that naturally follows correct hierarchical processing logic.
		Lowest for lowest level common ancestor node in the structure, Nearest and Closest for the nearest/closest common ancestor node.
	www.inconcept.com /jcm/may2005/David.html (8385 words)

	Print Version - SQL Has It and XQuery Does Not - Automatic LCA Processing \| Business intelligence, data warehousing and ... (Site not responding. Last check: 2007-10-24)
		Lowest Common Ancestor (LCA) logic is absolutely necessary for the processing of multi-leg hierarchical data structures.
		LCA logic is also used in biology, vision, AI, optimizations and many other scientific disciplines that utilize hierarchical structures to contain and process their data.
		The 4GL automatic LCA processing advantage means the user does not need to know or be concerned with the hierarchical data structure being used, any multi-leg query is performed automatically regardless of the number of legs involved.
	www.dmreview.com /editorial/dmreview/print_action.cfm?articleId=1033541 (939 words)

	California - Wikipedia, the free encyclopedia
		In the northern portion of the Mojave Desert on the east side of the state is Death Valley, which is the hottest spot on the Western Hemisphere.
		It is common in the summer for temperatures in the valley to reach 120 °F (49 °C).
		One thing they all have in common is a state mandate to teach fourth grade students about the history of California, including the role of the early missions; most schools implement this by requiring students to complete a multiple medium project.
	en.wikipedia.org /wiki/California (7380 words)

	Muhammad Ahsan Yusuf Eida (Site not responding. Last check: 2007-10-24)
		Lowest Common Ancestor -- fast preprocessing of the suffix tree for constant-time lowest common ancestor queries is needed in order to achieve optimal suffix preprocessing/querying algorithm.
		Compare the performance of their LCA preprocessing and query operations to that of the algorithm proposed by Schieber and Vishkin, "On finding lowest common ancestors: simplification and parallelization", SIAM Journal on Computing, Volume 17, Issue 6 (December 1988).
		But what is the LCA of 2 and the new node (the ancestor of 1), now the LCA will be the ancestor of 1.
	web.cecs.pdx.edu /~ps/code/ahsun/project2003.htm (355 words)

	content
		The number of common ancestors increases with the number of legs referenced in a query.
		The logic involved uses the Lowest Common Ancestor nodes between the referenced legs to coordinate and correlate the multi-leg processing.
		Common ancestor C node for DandE is located under common ancestor A node for B and (DandE) requiring nested common ancestor processing that naturally follows correct hierarchical processing logic.
	www.adatinc.com /pages/6/page6.html (7232 words)

	Dictionary
		For example, the node-based clade Dinosauria is defined as the most recent common ancestor of "birds" and Triceratops (Holtz and Padian 1995) and all its descendants, and diagnosed by at least three sacral vertebrae, a partially to fully open acetabulum, and other synapomorphies.
		For example, the most recent common ancestor of all modern birds and all its descendants is the crown clade Neornithes.
		The long neck of the giraffe is apomorphic; the short neck of its ancestor is plesiomorphic; a character present throughout a taxon because it is present in an outgroup of the taxon --plesiomorphy n.
	www.dinosauria.com /dml/diction.htm (3740 words)

	Approximate Matching with Suffix Trees
		Figure 1 - Lowest common ancestors for the nodes (x,y) and (i,j) in the suffix tree for 'mississippi'.
		The LCA explanation is based on a complete binary tree model (Fig 2), where each node in the tree is labelled with it's path number -- the bits that describe the path from the root the node in the tree.
		The mapping of the general tree to the binary tree aims to preserve enough of the ancestry relations in the general tree to allow lca relations in the binary tree to determine lca queries in the general tree.
	homepage.usask.ca /~ctl271/810/approximate_matching.shtml (4159 words)

	Language Log: Neanderthal Historical Linguistics
		The Telegraph Bancel and de l'Etang surveyed 1000 languages for which they were able to obtain detailed information on kinship terms and found that 700 of them contained the word "papa" with the meaning "father" or "male relative on the father's side".
		The third claim, that the ancestor of all currently known human languages, Proto-World, was the language first spoken by human beings, Proto-Human, assumes that no top-level branches are unknown to us.
		If any languages branched off from Proto-Human before the lowest ancestor of the languages we know and became extinct, as is quite possible, Proto-World would be a language separated, possibly by thousands of years, from Proto-Human.
	itre.cis.upenn.edu /~myl/languagelog/archives/001428.html (1038 words)

	Common Musical Instruments Used In Jazz (Site not responding. Last check: 2007-10-24)
		The immediate ancestor of the clarinet was the chalumeau, a short, cylindrical pipe with seven finger holes and a reed cut in its upper side, but without a bell-shaped opening.
		Shrill, narrow-bored flutes (FIFES) became common as military instruments, and one-handed, narrow-bored pipes played together with small drums accompanied dancing in southern France and are still used in northern Spain.
		The piano, the common abbreviation of pianoforte, is a chordophone (stringed musical instrument) in which the strings are struck by felt-covered hammers controlled by a keyboard.
	www.nw-cybermall.com /jazzworld/common_musical_instruments.htm (4104 words)

	HOWTO:Trees - BioPerl
		It is used in the calculations of monophyly and paraphyly and in determining the distance between two nodes.
		This means the common ancestor for the members of the internal_nodes group is more recent than the common ancestor that any of them share with the outgroup node.
		This means that a common ancestor 'A' for the members of the ingroup is more recent than a common ancestor 'B' that they share with the outgroup node and that there are no other nodes in the tree which have 'A' as a common ancestor before 'B'.
	www.bioperl.org /wiki/HOWTO:Trees (1962 words)

	RLOC
		The lowest common ancestor of the members is prefixed to the user-defined name to obtain the name of the set.
		The lowest common ancestor for their H_SET set is L, which gives it the name “A/D/L/hset.” After the flattening, NGDBuild attaches H_SET=A/hset to the F, G, H, O, P, J, and K primitives; H_SET=A/D/L/hset to the Q and R primitives; and H_SET=A/E/hset to the M and N primitives.
		In Figure 23-4, there would be no lowest common ancestor if macro A also had an RLOC constraint, since A is at the top of the design and has no ancestor.
	toolbox.xilinx.com /docsan/xilinx5/data/docs/cgd/cgd0188_27.html (6736 words)

	CHARLES - Online Information article about CHARLES
		Haus; in Gothic it is only found in gudhiss, a temple; it may be ultimately connected with the root of " hide," conceal)
		Claude, duke of Lorraine, 1st duke of Guise, 1'1544, t1550, ancestor of the dukes of =Antoinette of See also:
		original guitar brought from Italy by the duchess Amalie had five strings,2 the lowest A being the only one covered with wire.
	encyclopedia.jrank.org /CAU_CHA/CHARLES.html (662 words)

	Multivalent Architecture
		The HTML document tree often shows the results of extensive correction to the error-plagued markup all too common in the wild, as well as canonicalization to HTML 4.0 structuring, as for instance, TRs are placed in newly generated TBODYs and not permitted immediately directly under TABLE tags.
		For example table sorting rearranges the children of the given parent to achieve sorted order, clipboard markup generates a representation of the selected text with markup tags, and one type of search visualization hooks onto the scrollbar to paint its results on top of the scrollbar every time it is painted.
		A very common behavior type of behavior, the span, extends from a point internal to a start leaf linearly through leaf nodes to a point internal to an end leaf.
	multivalent.sourceforge.net /Developer/arch/INTEGRATE.html (5411 words)

	Cosc 300 - Program #1 (Site not responding. Last check: 2007-10-24)
		To figure out which cousin is which, find the lowest common ancestor in the family tree (there may be two who are husband and wife).
		m is determined by the difference between the distances from the two names to the common ancestor.
		So if one name is 3 away from the common ancestor (a great grandchild) and the other is 4 away (a great great grandchild), then the two are second (3-1) cousins, once (4-3) removed.
	www.mathcs.duq.edu /simon/Fall01/cs300p1.html (341 words)

	[xquery-talk] Absolute Path of Node (Site not responding. Last check: 2007-10-24)
		The fact that both paths start a/b doesn't actually mean that the two nodes have a common ancestor named b.
		You can find the lowest common ancestor of two nodes $a and $b as ($a/ancestor-or-self::node() intersect $b/ancestor-or-self::node())[last()].
		This will be the empty sequence if there is no common ancestor.
	www.xquery.com /pipermail/talk/2005-May/000608.html (373 words)

	A Further Improved LCA Algorithm (Site not responding. Last check: 2007-10-24)
		by Patrick Powell The lowest Common Ancestor algorithm of Scheiber and Vishkin is reviewed, and an improved version is outlined.
		The improved version has a much simpler initialization phase and method of calculating the LCA node values.
		If only the depth of the LCA is needed of leaf nodes of the tree is needed, as is the case in several algorithms involving string matching problems, the information necessary for finding the LCA of two leaf nodes can be stored in 3 arrays of m entries, eliminating the need for the tree.
	www.cs.umn.edu /tech_reports_upload/1990/TR_90-01_A_Further_Improved_LCA_Algorithm.html (91 words)

	[No title] (Site not responding. Last check: 2007-10-24)
		Faith is the most common mode of belief in the Western world, where the Abrahamic religions are prevalent.
		Mysticism is the most common mode of belief in the Eastern world.
		A common misconception is that science might be an alternative to religion for answering questions about meaning and value.
	humanknowledge.net /HumanKnowledge.txt (17891 words)

	[No title]
		In its sense as a moving point in geometry, its hypernyms are: The lowest common ancestor for these two senses is the hypernym shape, form.
		A hypernym path goes up the hypernym hierarchy from the first word to a common ancestor and then down to the second word.
		Note that a hypernym path from a node other than the lowest common ancestor will always be equal to or longer than the hypernym path provided by the lowest common ancestor.
	www.ai.mit.edu /courses/6.863/laboratory4.doc (3509 words)

	:: CoDe Magazine ::
		This works fine for a group of objects that may be based on the same superclass, or otherwise share a common ancestor.
		Any group of object classes can implement a common interface, and such an interface can be used in an object collection or passed as an argument by extracting the interface alone, using the CType() function to cast the object as it's interface.
		Classes can implement a common interface, and you can use an interface in an object collection or passed as an argument by extracting the interface alone, using the CType() function.
	www.code-magazine.com /Focus/Article.aspx?quickid=0301111 (2859 words)

	CPS 100 - Assignment 5 - FALL 1996
		Find the lowest common ancestor of x and y in the tree.
		Any two nodes in a tree have one or more common ancestors.
		The lowest common ancestor is the one that is closest to the nodes.
	www.cs.duke.edu /~rodger/courses/cps100/assign/assign5.html (879 words)

	Family Tree Information
		Second marriages are shown as though the family member had a younger sibling with the identical name.
		Just find the lowest common ancestor between two relatives and locate the relationship of one of the relatives to the common ancestor on the top row.
		Locate the relationship of the other relative to the common ancestor in the left column.
	www.mfr-eng.com /rumreich/treeinfo.htm (316 words)

	Computer Science Course Listing (Site not responding. Last check: 2007-10-24)
		The course will focus on techniques fo rthe design and analysis of data structures and algorithms for sequence-analysis problems, including sequence comparison, sequence matching, longest common substring, longest common subsequence, shortest superstring, motif discovery, phylogeny alignment, sequence based predictions, and heurisitic design.
		We study algorithms and heuristics for computational biology problems including shotgun sequencing, sequencing by hybridization, restriction map and physical map construction, regulatory network inference, and RNA and protein structure inference.
		The course is dominated by the study string problems and algorithms including: shortest superstring hardness and approximations, approximate string matching, exact string matching, string searching, suffix trees and arrays, lowest common ancestor, approximate string matching and edit distance.
	web.cecs.pdx.edu /~henselmn/course.php?cid=206 (382 words)

	CSE 648 - Preliminaries (Lectures 3-5) (Site not responding. Last check: 2007-10-24)
		However, the problem of finding the shortest common superstring of a set of strings is NP-complete.
		Due to repeats, the shortest common superstring is typically shorter than the real sequence.
		However, after we augment the suffix tree so as to answer lowest common ancestor queries in constant time...
	www.cs.sunysb.edu /~skiena/549/lectures/assembly (2378 words)

	A Platform-Neutral Solution to Native XML Integration with SQL, part 3: (Lowest Common Ancestor) (Site not responding. Last check: 2007-10-24)
		SQL’s natural hierarchical processing inherently supports multi-leg queries because the correlation logic required, known as Lowest Common Ancestor (LCA) logic, is automatically being performed by the relational engine.
		This naturally forms Cartesian products under the lowest common relationship nodes where its processing automatically simulates LCA processing.
		This automatic LCA process also ensures valid hierarchical processing is performed for single or multi-leg queries.
	www.sqlsummit.com /Articles/XMLSQLOuterJoin3.HTM (776 words)

	Web Graph Analysis in Perspective -- Kenneth Farrall
		First, we review some of the most common analytical constructs in social network theory according to the network parameters on which they are based.
		Despite their use of the term, the identification of "web communites" within the computer science literature is best understood as some form of semantic community, where documents form clusters of common meaning, rather than a true community of people.
		Entropy, or information content, is calculated for the lowest (most specific) common ancestor for the two pages as well as for their respective individual categories, comparing both the informational difference and shared meaning between the two documents.
	farrall.org /papers/webgraph_as_content.html (8778 words)

	Bug ID: 5043395 1.4.2_04 Server VM - C2 crash in PhaseCFG::ScheduleLate on Solaris
		Later during ScheduleLate() we take Phi's block as earliest and the original call's block (it still has call's uses) as LCA (Lowest common ancestor).
		Then we walk up the dominator tree from this LCA to the earliest block.
		And we end up in the root block since dom depth of the LCA high then the earliest block so we can not go there.
	bugs.sun.com /bugdatabase/view_bug.do?bug_id=5043395 (293 words)

	NLP.WordNet.WordNet (Site not responding. Last check: 2007-10-24)
		This function takes an empty bag (in particular, this is to specify what type of search to perform), and the results of two search.
		It returns (maybe) the lowest point at which the two terms meet in the WordNet hierarchy.
		It returns (maybe) the lowest point at which the two terms meet in the WordNet hierarchy, as well as the paths leading from each term to this common term.
	www.isi.edu /~hdaume/HWordNet/docs/NLP.WordNet.WordNet.html (579 words)

	Extracting functional information from microarrays: A challenge for functional genomics -- Zhang 99 (20): 12509 -- ...
		by common transcription factors, or their products are the components
		"lowest common ancestor" of all the process subcategories corresponding
		are in the same node, the lowest common ancestor is the starting
	www.pnas.org /cgi/content/full/99/20/12509 (1742 words)

	abstract for DEA research (Site not responding. Last check: 2007-10-24)
		We study the complexity of Tarjan's Lowest Common Ancestor Algorithm in a tree, as presented in a parallelized version by Shieber and Vishkin.
		We prove that this algorithm is an encoding which consists in three successive order morphisms (path partition, binary recalibration and embedding).
		This leads us to define several classes of encodings, independent from the kind of orders they support; an encoding extension is linking the different algorithms in each class.
	www.isima.fr /~sigayret/dea.htm (131 words)

	Opening Doors: Notes On the Delphi ToolsAPI by its Creator (Site not responding. Last check: 2007-10-24)
		In most cases, when a descendant of IOTANotifier is implemented, all the ancestors must be declared and implemented as well.
		This is due to the fact that the IDE centralizes the calling of these interfaces so it must work on the lowest common ancestor.
		This is one of the common errors made by OTA developers.
	community.borland.com /article/0,1410,20360,00.html (824 words)

Try your search on: Qwika (all wikis)