Bellerophon program: Difference between revisions
Content deleted Content added
There is no such word as "adaption." |
Loss Gillios (talk | contribs) No edit summary |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
{{Verification|date=August 2023}} |
|||
'''''Bellerophon''''' is a computer program for detecting [[Chimera (EST)|chimeric]] sequences in multiple sequence datasets by an adaptation of partial treeing analysis.<ref>{{Cite journal |
'''''Bellerophon''''' is a computer program for detecting [[Chimera (EST)|chimeric]] sequences in multiple sequence datasets by an adaptation of partial treeing analysis.<ref>{{Cite journal |
||
| Line 13: | Line 14: | ||
| pmid = 15073015 |
| pmid = 15073015 |
||
| pmc = |
| pmc = |
||
| doi-access = free |
|||
}}</ref> ''Bellerophon'' was specifically developed to detect 16S [[rRNA]] gene [[Chimera (EST)|chimera]]s in PCR-clone libraries of environmental samples but can be applied to other [[nucleotide sequence]] alignments. |
}}</ref> ''Bellerophon'' was specifically developed to detect 16S [[rRNA]] gene [[Chimera (EST)|chimera]]s in PCR-clone libraries of environmental samples, but can be applied to other [[nucleotide sequence]] alignments. |
||
==External links== |
==External links== |
||
Latest revision as of 13:54, 24 August 2023
 | This article needs additional citations for verification. (August 2023) |
Bellerophon is a computer program for detecting chimeric sequences in multiple sequence datasets by an adaptation of partial treeing analysis.[1] Bellerophon was specifically developed to detect 16S rRNA gene chimeras in PCR-clone libraries of environmental samples, but can be applied to other nucleotide sequence alignments.
External links
[edit]References
[edit]- ^ Huber, T.; Faulkner, G.; Hugenholtz, P. (2004). "Bellerophon: A program to detect chimeric sequences in multiple sequence alignments". Bioinformatics. 20 (14): 2317–2319. doi:10.1093/bioinformatics/bth226. PMID 15073015.
 | This scientific software article is a stub. You can help Wikipedia by expanding it. |