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 _recursive(self, *sequences: str) -> str:
      if not all(sequences):
          return type(sequences[0])()  # empty sequence
      if self.test_func(*[s[-1] for s in sequences]):
          c = sequences[0][-1]
          sequences = tuple(s[:-1] for s in sequences)
          return self(*sequences) + c
      m = type(sequences[0])()  # empty sequence
      for i, s in enumerate(sequences):
          ss = sequences[:i] + (s[:-1],) + sequences[i + 1 :]
          m = max([self(*ss), m], key=len)
      return m
  
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 3 for calling the LCSSeq obj's underlying member method code with example usage: obj._recursive() and returns: m, type, unknown