moscot.problems.time.TemporalProblem.prepare

TemporalProblem.prepare(time_key, joint_attr=None, policy='sequential', cost='sq_euclidean', cost_kwargs=mappingproxy({}), a=None, b=None, marginal_kwargs=mappingproxy({}), subset=None, reference=None, xy_callback=None, x_callback=None, y_callback=None, xy_callback_kwargs=mappingproxy({}), x_callback_kwargs=mappingproxy({}), y_callback_kwargs=mappingproxy({}), x=mappingproxy({}), y=mappingproxy({}), xy=mappingproxy({}))

Prepare the temporal problem problem.

See also

• See Disentangling lineage relationships of delta and epsilon cells in pancreatic development with the TemporalProblem on how to prepare and solve the TemporalProblem.

Parameters:

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

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

  How to get the data that defines the linear problem:

  • 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 (Literal['euclidean', 'sq_euclidean', 'cosine', 'pnorm_p', 'sq_pnorm', 'geodesic']) –

  Cost function to use. Valid options are:

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

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

    • 'xy' - cost function for the linear term, same as above.

• 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 (Union[bool, str, None]) –

  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 (Union[bool, str, None]) –

  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.

• subset (Sequence[Tuple[int | float, int | float]] | None)

• reference (Any | None)

• xy_callback (Literal['local-pca'] | ~typing.Callable[[~typing.Literal['xy', 'x', 'y'], ~anndata._core.anndata.AnnData, ~anndata._core.anndata.AnnData | None], ~moscot.utils.tagged_array.TaggedArray | None] | None)

• x_callback (Literal['local-pca'] | ~typing.Callable[[~typing.Literal['xy', 'x', 'y'], ~anndata._core.anndata.AnnData, ~anndata._core.anndata.AnnData | None], ~moscot.utils.tagged_array.TaggedArray | None] | None)

• y_callback (Literal['local-pca'] | ~typing.Callable[[~typing.Literal['xy', 'x', 'y'], ~anndata._core.anndata.AnnData, ~anndata._core.anndata.AnnData | None], ~moscot.utils.tagged_array.TaggedArray | None] | None)

• xy_callback_kwargs (Mapping[str, Any])

• x_callback_kwargs (Mapping[str, Any])

• y_callback_kwargs (Mapping[str, Any])

• x (Mapping[str, Any])

• y (Mapping[str, Any])

• xy (Mapping[str, Any])

Return type:

TemporalProblem

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 'linear'.