moscot.problems.time.LineageProblem.prepare

LineageProblem.prepare(time_key, lineage_attr=mappingproxy({}), joint_attr=None, policy='sequential', cost='sq_euclidean', cost_kwargs=mappingproxy({}), a=None, b=None, marginal_kwargs=mappingproxy({}), **kwargs)

Prepare the lineage problem problem.

See also

• See Mapping lineage-traced cells across time points with moslin on how to prepare and solve the LineageProblem.

Parameters:

• time_key (str) – Key in obs where the time points are stored.

• lineage_attr (Mapping[str, Any]) –

  How to get the lineage information, such as barcodes or lineage trees, for the quadratic term:

  • dict - it should contain 'attr' and 'key', the attribute and key in AnnData, and optionally 'tag' from the tags. If an empty dict is passed, use pre-computed cost matrices stored in obsp['cost_matrices'].

• joint_attr (Union[str, Mapping[str, Any], None]) –

  How to get the data for the linear term in the fused case:

  • None - PCA on X is computed.

  • str - key in obsm where the data is stored.

  • dict - it should contain 'attr' and 'key', the attribute and key in AnnData, and optionally 'tag' from the tags.

  By default, tag = 'point_cloud' is used.

• policy (Literal['sequential', 'triu', 'tril', 'explicit']) –

  Rule which defines how to construct the subproblems using obs['{time_key}']. Valid options are:

  • 'sequential' - align subsequent time points [(t0, t1), (t1, t2), ...].

  • 'triu' - upper triangular matrix [(t0, t1), (t0, t2), ..., (t1, t2), ...].

  • 'tril' - lower triangular matrix [(t_n, t_n-1), (t_n, t0), ..., (t_n-1, t_n-2), ...].

  • 'explicit' - explicit sequence of subsets passed via subset = [(b3, b0), ...].

• cost (Union[Literal['euclidean', 'sq_euclidean', 'cosine', 'pnorm_p', 'sq_pnorm', 'elastic_l1', 'elastic_l2', 'elastic_stvs', 'elastic_sqk_overlap', 'geodesic'], Literal['barcode_distance', 'leaf_distance', 'custom'], Mapping[str, Union[Literal['euclidean', 'sq_euclidean', 'cosine', 'pnorm_p', 'sq_pnorm', 'elastic_l1', 'elastic_l2', 'elastic_stvs', 'elastic_sqk_overlap', 'geodesic'], Literal['barcode_distance', 'leaf_distance', 'custom']]]]) –

  Cost function to use. Valid options are:

  • str - name of the cost function for all terms, see get_available_costs().

  • dict - a dictionary with the following keys and values:

    • 'xy' - cost function for the linear term.

    • 'x' - cost function for the source quadratic term, e.g., LeafDistance() or BarcodeDistance().

    • 'y' - cost function for the target quadratic term, e.g., LeafDistance() or BarcodeDistance().

• cost_kwargs (Union[Mapping[str, Any], Mapping[Literal['x', 'y', 'xy'], Mapping[str, Any]]]) – Keyword arguments for the BaseCost or any backend-specific cost.

• a (Optional[str]) –

  Source marginals. Valid options are:

  • str - key in obs where the source marginals are stored.

  • bool - if True, estimate the marginals, otherwise use uniform marginals.

  • None - set to True if proliferation_key or apoptosis_key is not None.

• b (Optional[str]) –

  Target marginals. Valid options are:

  • str - key in obs where the target marginals are stored.

  • bool - if True, estimate the marginals, otherwise use uniform marginals.

  • None - set to True if proliferation_key or apoptosis_key is not None.

• marginal_kwargs (Mapping[str, Any]) – Keyword arguments for estimate_marginals(). It always contains proliferation_key and apoptosis_key, see score_genes_for_marginals() for more information.

• kwargs (Any) – Keyword arguments for prepare().

Return type:

LineageProblem

Returns:

: Returns self and updates the following fields:

• problems - the prepared subproblems.

• solutions - set to an empty dict.

• temporal_key - key in obs where time points are stored.

• stage - set to 'prepared'.

• problem_kind - set to 'quadratic'.