Skip to content
This repository has been archived by the owner on Aug 23, 2022. It is now read-only.

Potential limitation of fragment size #24

Open
mengzhou opened this issue Nov 29, 2016 · 2 comments
Open

Potential limitation of fragment size #24

mengzhou opened this issue Nov 29, 2016 · 2 comments

Comments

@mengzhou
Copy link
Member

The fragment size of a pair-end alignment is returned by this function as an int. Of course in most cases this would be sufficient, but sometimes we might need a very long fragment. Just to keep a record for future usage.

@bdecato
Copy link
Member

bdecato commented Nov 29, 2016

A quick change to a size_t type would increase the maximum from 32767 to at least 65351. Not a fix, but after speaking with @rishvanth-kp it seems this would handle most nanopore reads.

WALT is also future-proof for nanopore by allowing mismatches in terms of percentage of the read length, rather than absolute number. This is useful because as the read length increases, the probability of ambiguous mapping introduced by allowing more mismatches will decrease.

And of course, it is unlikely we will ever need to use WALT for nanopore anyway, since hopefully we will be able to distinguish mCpG from CpG based on electrical signal. But I could see that signal being converted to a T or U for mapping purposes.

Is there a situation where we would use WALT or update it with reads longer than 65kb? I feel like a greedy partial-exact-matching approach of some kind would be preferential to 26bp seeds in that case.

@acgtun
Copy link
Contributor

acgtun commented Nov 30, 2016

  • int len could be negative, maybe it is better to change it to long or long long in C++.

  • For nanopore reads, it may need to develop new algorithm to handle some specific concern of long reads, not sure yet

  • in the current version, as i remember, as long the read length is less than 2^32, it should be OK.

Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Labels
None yet
Projects
None yet
Development

No branches or pull requests

3 participants