State Of The Art In Base-Calling?
2
1
Entering edit mode
11.8 years ago
asjo ▴ 120

What is state-of-the art in base-calling for Sanger sequencing these days?

Does Phred+Phrap still reign supreme? Do newer or better programs exist? What are people using? Any Free (open source) implementations?

References to algorithms, implementations, or papers would be great.

calling sanger sequencing • 3.0k views
ADD COMMENT
0
Entering edit mode

what type of basecalling are you referring to? For high throughput sequencing the base calling has been offloaded almost entirely to the instrument and is part of the preprocessing provided by the vendor.

ADD REPLY
0
Entering edit mode

I was thinking of "classical"(?) Sanger sequencing. Sorry, I should have specified that. I have updated the question and tags accordingly.

ADD REPLY
3
Entering edit mode
11.8 years ago

For an alternative (and supposedly better) caller on Illumina, see this link:

Massingham, T and Goldman, N (2012) All Your Base: a fast and accurate probabilistic approach to base calling. Genome Biology 13:R13

Citations might help too.

ADD COMMENT
1
Entering edit mode

I think he is referring to Sanger sequencing technology.

ADD REPLY
0
Entering edit mode

unrelated observations: the paper was submitted on July 29, 2011, accepted on Feb 29, 2012. First that's quite a long wait, then it has matching days of the months, plus a leap day - hey bioinformaticians who can tell me what's the p-value of that happening?

ADD REPLY
0
Entering edit mode

Not to mention that the title is an internet culture reference...

ADD REPLY
1
Entering edit mode
11.8 years ago
Gabriel R. ★ 2.9k

As far as I can tell yes, anyway the errors in Sanger are so low that I would not worry too much about basecalling.

ADD COMMENT
1
Entering edit mode

Except for when you are trying to call heterozygotes...spent a year and a half of my life on that...

ADD REPLY

Login before adding your answer.

Traffic: 1561 users visited in the last hour
Help About
FAQ
Access RSS
API
Stats

Use of this site constitutes acceptance of our User Agreement and Privacy Policy.

Powered by the version 2.3.6