Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Upper Bound Recall-- with GTF (Corset) #2

Closed
k3yavi opened this issue Jan 22, 2016 · 3 comments
Closed

Upper Bound Recall-- with GTF (Corset) #2

k3yavi opened this issue Jan 22, 2016 · 3 comments
Assignees
@k3yavi
Labels
question

Comments

@k3yavi
Copy link
Member

k3yavi commented Jan 22, 2016

Find out the upper Bound with given GTF
@k3yavi k3yavi self-assigned this Jan 22, 2016
@k3yavi
Copy link
Member Author

k3yavi commented Jan 22, 2016

All of the combinations tested are recoverable,
BUT still need to test, if the shared region itself has any mapped reads

@k3yavi
Copy link
Member Author

k3yavi commented Jan 22, 2016

commit 5ecf07c

@k3yavi
Copy link
Member Author

k3yavi commented Jan 23, 2016

latest check in snake check_recall.sm
As it turns out not a lot of combinations are recoverable.
Assuming initial recall was 0.5 and FN were 72842.
New recall can be improved by only 6548 combinations making in marginal increase of upper bound in recall to 0.545

@k3yavi k3yavi closed this as completed Jan 23, 2016
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@k3yavi k3yavi

Labels
question
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@k3yavi