LongestCommonSubsequencePositions

LongestCommonSubsequencePositions[s1,s2]

找出字符串、生物分子序列或列表 s1 和 s2 中由相邻元素组成的最长子公共序列，并返回它们在 s1 和 s2 中的位置 {pos1,pos2}.

更多信息和选项

范例

打开所有单元关闭所有单元

基本范例  (3)

给出两个字符串最长的公共相邻子序列：

给出两个列表最长的公共相邻子序列：

求两个生物分子序列共有的最长连续子序列：

范围  (2)

用于两个字符串：

用于两个表达式列表：

选项  (1)

IgnoreCase  (1)

默认情况下，LongestCommonSubsequencePositions 区分大小写：

忽略大小写：

应用  (1)

两个基因公共的最长相邻 DNA 子序列：

属性和关系  (1)

取两个字符串：

给出最长公共字符序列的位置：

公共字符串：

LongestCommonSubsequence 返回连在一起的字符串：

Wolfram Research (2015)，LongestCommonSubsequencePositions，Wolfram 语言函数，https://reference.wolfram.com/language/ref/LongestCommonSubsequencePositions.html.

文本

Wolfram Research (2015)，LongestCommonSubsequencePositions，Wolfram 语言函数，https://reference.wolfram.com/language/ref/LongestCommonSubsequencePositions.html.

CMS

Wolfram 语言. 2015. "LongestCommonSubsequencePositions." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/ref/LongestCommonSubsequencePositions.html.

APA

Wolfram 语言. (2015). LongestCommonSubsequencePositions. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/ref/LongestCommonSubsequencePositions.html 年

BibTeX

@misc{reference.wolfram_2024_longestcommonsubsequencepositions, author="Wolfram Research", title="{LongestCommonSubsequencePositions}", year="2015", howpublished="\url{https://reference.wolfram.com/language/ref/LongestCommonSubsequencePositions.html}", note=[Accessed: 21-November-2024 ]}

BibLaTeX

@online{reference.wolfram_2024_longestcommonsubsequencepositions, organization={Wolfram Research}, title={LongestCommonSubsequencePositions}, year={2015}, url={https://reference.wolfram.com/language/ref/LongestCommonSubsequencePositions.html}, note=[Accessed: 21-November-2024 ]}