LongestCommonSequence

LongestCommonSequence[s1,s2]

文字列，リスト，あるいは生体分子配列 s1 と s2に共通の，連続あるいは不連続の要素の最長の列を求める

詳細とオプション

例題

すべて開くすべて閉じる

例  (3)

2つの文字列に共通の，最長非近接列を返す：

2つのリストに共通の，最長非近接列を返す：

2つの生体分子配列に共通する最長の非連続配列を求める：

おもしろい例題  (1)

長さ100のランダムな二進数列中の最長共通列の長さを求める：

Wolfram Research (2008), LongestCommonSequence, Wolfram言語関数， https://reference.wolfram.com/language/ref/LongestCommonSequence.html （2020年に更新）.

テキスト

Wolfram Research (2008), LongestCommonSequence, Wolfram言語関数， https://reference.wolfram.com/language/ref/LongestCommonSequence.html （2020年に更新）.

CMS

Wolfram Language. 2008. "LongestCommonSequence." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2020. https://reference.wolfram.com/language/ref/LongestCommonSequence.html.

APA

Wolfram Language. (2008). LongestCommonSequence. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/LongestCommonSequence.html

BibTeX

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

BibLaTeX

@online{reference.wolfram_2024_longestcommonsequence, organization={Wolfram Research}, title={LongestCommonSequence}, year={2020}, url={https://reference.wolfram.com/language/ref/LongestCommonSequence.html}, note=[Accessed: 22-November-2024 ]}