mir.graph package#

Search behavior#

Graph and neighborhood edit-distance searches use tcrtrie as the primary engine. If trie search raises an error for a query, code falls back to a length-constrained brute-force comparison:

  • hamming: only equal-length sequences are compared.

  • levenshtein: only candidates with length difference <= threshold are

    compared.

Submodules#

mir.graph.distance_utils module#

mir.graph.edit_distance_graph module#

mir.graph.neighborhood_enrichment module#

mir.graph.token_graph module#

mir.graph.single_cell_pairing module#

Module contents#