lcom_subseq.html

来自「Data Structure Ebook」· HTML 代码 · 共 65 行

HTML

65 行

<HTML><HEAD>
<TITLE>Data Structures and Algorithms: Longest Common Subsequence</TITLE>

<META name="description" content="Data Structures and Algorithms Course Notes,
PLDS210 University of Western Australia">
<META name="keywords" content="data structures,algorithms,abstract data types,
matrix chain multiplication, dynamic algorithms">
</HEAD>
<BODY BGCOLOR="#ffffff">
<TABLE BGCOLOR="#00c0f0" WIDTH="100%" CELLSPACING=0 CELLPADDING=0>
<TR BGCOLOR="#00f0f0"><TD ALIGN=right>
<FONT FACE=helvetica SIZE=+1><I>Data Structures and Algorithms</I></FONT>
</TD></TR>

<TR><TD><FONT FACE=helvetica SIZE=+2><B>Longest Common Subsequence</B></FONT>
</TD></TR>
</TABLE>
<P>

Another problem that has a <I>dynamic</I> solution is that
of finding the longest common subsequence.

<H4>Problem</H4>
Given two sequences of symbols, X and Y,
determine the longest subsequence of symbols that appears
in both X and Y.

<H4>Reference</H4>
Cormen, Section 16.3<BR>
<A HREF="javascript:if(confirm('http://www.cs.pitt.edu/~kirk/cs1510/dynnotes/node3.html  \n\nThis file was not retrieved by Teleport Pro, because it is addressed on a domain or path outside the boundaries set for its Starting Address.  \n\nDo you want to open it from the server?'))window.location='http://www.cs.pitt.edu/~kirk/cs1510/dynnotes/node3.html'" tppabs="http://www.cs.pitt.edu/~kirk/cs1510/dynnotes/node3.html" TARGET=lcs>
Lecture notes by Kirk Pruhs, University of Pittsburgh</A><BR>
<A HREF="javascript:if(confirm('http://www.cc.gatech.edu/classes/cs3158_98_fall/lcs.html  \n\nThis file was not retrieved by Teleport Pro, because it is addressed on a domain or path outside the boundaries set for its Starting Address.  \n\nDo you want to open it from the server?'))window.location='http://www.cc.gatech.edu/classes/cs3158_98_fall/lcs.html'" tppabs="http://www.cc.gatech.edu/classes/cs3158_98_fall/lcs.html" TARGET=lcs>
Pseudo-code from John Stasko's notes for CS3158 at Georgia Tech</A>


<P>
<TABLE WIDTH="100%" >
<TR><TD BGCOLOR="#00c0f0"><FONT FACE=helvetica,arial SIZE=+2><B>Key terms</B></TD></TR>
<TR>
<TD>
<DL>
<DT><FONT COLOR="#fa0000"><B>optimal sub-structure</B></FONT>
   <DD>a property of optimisation problems in which the sub-problems
       which constitute the solution to the problem itself are themselves
       optimal solutions to those sub-problems.
       This property permits the construction of dynamic algorithms to
       solve the problem.
</DL>
</TD></TR>
</TABLE>

<P>

<TABLE CELLPADDING=5 WIDTH="100%" BGCOLOR="#00f0f0" CELLSPACING=4>
<TR><TD WIDTH=50%>
<FONT FACE=arial,helvetica>Continue on to <A HREF="opt_tri.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/opt_tri.html">
Optimal Triangulation</A></TD>
<TD><FONT FACE=arial,helvetica>Back to the <A HREF="ds_ToC.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/ds_ToC.html">Table of Contents</A>
</TD></TR></TABLE>
<SMALL>
&copy; <A HREF=mailto:morris@ee.uwa.edu.au>John Morris</A>, 1998
</SMALL>
</BODY>
</HTML>

lcom_subseq.html - 源码说明

本页面展示了「Data Structure Ebook」中的 lcom_subseq.html 源码文件，采用 HTML 编程语言编写，共 65 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。

虫虫下载站收录了大量与Structure相关的技术资源，包括源代码、技术文档、电路图等，是电子工程师和嵌入式开发者的专业学习平台。

⌨️ 快捷键说明

复制代码Ctrl + C

搜索代码Ctrl + F

全屏模式F11

增大字号Ctrl + =

减小字号Ctrl + -

显示快捷键?