Skip to content

More details lineage reconstruction algorithm #1497

Answered by mizraelson
NoELJ22 asked this question in Q&A
Discussion options

You must be logged in to vote

Briefly:

  1. In the first step, all NDN regions are aligned with each other, incurring a certain penalty for each mismatch. These penalty scores are then normalized by the length of the region. If this normalized metric is lower than the threshold set by -Osteps[0].algorithm.maxNDNDistanceForClustering=1.0, the clones will be clustered.

  2. In the second step, MiXCR attempts to add additional members to the tree without disrupting its structure. The parameter -Ostep[1].maxNDNDistance=1.5 controls the maximum distance allowed between the NDN-region of the added clonotypes and the closest existing tree member.

  3. In the third step, MiXCR tries to merge entire trees that have similar most recent …

Replies: 2 comments 2 replies

Comment options

You must be logged in to vote
0 replies
Answer selected by mizraelson
Comment options

You must be logged in to vote
2 replies
@mizraelson
Comment options

@NoELJ22
Comment options

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Category
Q&A
Labels
None yet
2 participants