My Problem:

Skipping some specific background, what I want to do isjudging whether some soft-clipping sequences are the same, which may result by the same SV event. Colored bases in Fig.1 is an example of soft-clipping sequences.

I useBWA -MEM as the aligner. And I am trying to develop an SV caller actually, what I want to do here is refining PE(Paired-Ends) signal. If it is SR(Split-Reads), I don't need to do this, because of SR and its supplemental alignments coming from the same read. But PE signal generated from some cluster procedures need some filters. And I think K-mer is not a good way to do this which adapted by some SV callers. For me, as a bioinformatic fool, imitation and implementation may be a good learning process. It seems still a long way to go.

My solution:

I suppose this is a sequence alignment problem. Then I use FM-indexing based on BWT to do this. My inexact/approximate matching implementation is referred fromBWA.

My workflow:

1. Extract these soft-clipping sequences
2. Choose the longest one as the reference
3. Iterate others to match with the reference, if the number of unmatched is large than 1, it means these sequences are not the same.

• Question 1:Is that sounds reasonable to you? Any suggestions?

• Question 2:If it is OK, how should I implementthe penalty scoring scheme?
  Here, because these sequences should come from the same SV event, the main differences(Mismatch, InDel) should arise from sequencing errors, not small genomic variants. So I want to set a higher gap open penalty and even higher gap extend penalty, like

  mismatch_penalty = 4gapopen_penalty = 11gapextend_penalty = 20alignment penalty cutoff = 30

The later means that one alignment with two more gaps will be considered as spurious alignment.

How do I optimize these parameters?

1 Answer1

Start asking to get answers

Find the answer to your question by asking.

Explore related questions

See similar questions with these tags.