Qurak
ドキュメント
料金
サインイン
Qurak
ドキュメント
関数
LongestCommonSubsequence
LongestCommonSubsequence
利用可能
Returns the longest subsequence common to two strings.
形式
LongestCommonSubsequence[s1, s2]
検証済みの例
LongestCommonSubsequence["abcde", "xbxdy"] → b
Qurakで実行
リファレンスを検索
トピック
Biomolecular Sequences
- Bio Subsequence Computation
Mathematical And Counting Operations On Lists
- Sequence-Related Operations »
New In70 Alphabetical Listing
- L
New In70 Core Language
- New in String Manipulation and Comparison »
Sequence Alignment And Comparison
- Similarity and Distance Measures»
String Manipulation
- String Alignment & Comparison »
関連
LongestCommonSequence
SequenceAlignment
NeedlemanWunschSimilarity
Longest
Subsequences
BioSequence
LongestCommonSequencePositions
LongestCommonSubsequencePositions
SequenceCases
SequenceCount
SequencePosition
DistanceMatrix
← LongestCommonSequencePositions
LongestCommonSubsequencePositions →
全 6300 関数
·
MCPクライアントから使う