class_docstr: longest common subsequence similarity
  
  https://en.wikipedia.org/wiki/Longest_common_subsequence_problem
class_docstr_tok: ["longest","common","subsequence","similarity","https",":","\/\/en.wikipedia.org\/wiki\/Longest_common_subsequence_problem"]
code: def __call__(self, *sequences: str) -> str:
      if not sequences:
          return ""
      sequences = self._get_sequences(*sequences)
      if len(sequences) == 2:
          return self._dynamic(*sequences)
      else:
          return self._recursive(*sequences)
  
imports: from __future__ import annotations
  from difflib import SequenceMatcher
  from typing import Any
  from ..utils import find_ngrams
  from .base import BaseSimilarity
  from .types import TestFunc
label_desc: Use image node_id 4 for calling the LCSSeq obj's underlying member method code with example usage: obj.__call__() and returns: str, self, self