Wikipedia:WikiProject Molecular Biology/Computational Biology/ISCB competition entries 2018
Before you sign up... |
---|
Make sure you're logged in! |
If you already have a Wikipedia account, make sure you've logged in with your account name and password before you register for the competition. To log in, just click this link, or the "Log in" link in the top right corner of the page. |
Don't have an account? |
If you don't already have a Wikipedia account, you can create an account by clicking this link, or the "Create account" link in the top right corner of the page. You'll need to choose a username and password. For more information, see Wikipedia:Why create an account? |
This page is for entering the 2018 ISCB Wikipedia competition to improve computational biology content in Wikipedia.
You can find out more about the rules and regulations on the announcement page.
Entries
[edit]- Claims may be made starting 1 January. The competition ends on 25 May, 2018 (UTC).
English
[edit]Please register your interest by typing the following text while logged in as a registered Wikipedia user:
* [[]] --~~~~
This will display your claim on an article in the following way, using the article on Bioinformatics as an example:
Translations from other Wikipedia languages are welcome but have to be indicated as such. Please add your claims (no more than two in total across the English and non-English competitions) below (please order them alphabetically, so that duplicates are easily detectable):
- 23andMe --ec884814 (talk) 11:28, 6 April 2018 (UTC)
- Autophagy database --abigailallen95 (talk) 17:53, 8 April 2018 (UTC)
- BioJava --aaronmcquade (talk) 01:10, 12 April 2018 (UTC)
- BioMart --bm208613 (talk) 21:51, 13 April 2018 (UTC)
- BioPerl --Db862013 (talk) 01:28, 14 April 2018 (UTC)
- Biostatistics --CorrFH (talk) 13:04, 19 March 2018 (UTC) --Cthaynig (talk) 13:07, 19 March 2018 (UTC) --Dcbmariano (talk) 21:06, 19 March 2018 (UTC) --letbg (talk) 23:13, 19 March 2018 (UTC) --SantosRenatoAC(talk) 01:59, 21 March 2018 (UTC) --Jcagstos (talk) 17:47, 22 March 2018 (UTC)
- Clustal --Ne098715 (talk) Dw604914 (talk) 20:51, 11 April 2018 (UTC)
- Evolutionary grade --Ma942913 (talk) 14:35, 13 April 2018 (UTC)
- FASTA --cs674115 (talk) 10:01, 13 April 2018 (UTC)
- Gap penalty --Mullinmax (talk) 14:51, 13 April 2018 (UTC)
- Genome Architecture Mapping --Yz209517 (talk) 21:23, 13 April 2018(UTC)
- Glycoinformatics --Lpi01 (talk) 13:50, 20 May 2018 (UTC)
- MAFFT --Hn064614 (talk) 11:39, 10 April 2018 (UTC)
- MEGAN --Alexahong01 (talk) 10:49, 10 April 2018 (UTC)
- Metabolomics -- ycyc0927 (talk) 21:32, 11 April 2018 (UTC)
- Microarray analysis techniques --Kf811812 (talk) 22:16, 13 April 2018 (UTC)
- Molecular phylogenetics -- KaylaMSteen (talk) 12:34, 6 April 2018 (UTC)
- Multiple Sequence Alignment -- eb708811 (talk) 11:43, 10 April 2018 (UTC)
- Ruzzo-Tompa algorithm -- (John_Douglas_Huff) (talk) 11:24, 16 April 2018 (UTC)
- Saccharomyces Genome Database -- yh707911 (talk) 12:04, 10 April 2018 (UTC)
- Structural bioinformatics -- PalashSethi (talk) 09:35, 4 February 2018 (UTC)
- TopHat (bioinformatics) -- Stanleybee (talk)
- UCSC Genome Browser -- Jw019211 (talk) 09:02, 13 April 2018 (UTC)
- Virtual screening -- Gyasi111 (talk) 10:44, 13 April 2018 (UTC)
Other languages
[edit]Please register your interest by typing the following text while logged in as a registered Wikipedia user (for LanguageCode, see the "Wiki" column in this list of Wikipedias):
* [[:LanguageCode:Article name]] --~~~~
This will display your claim on an article in interwiki syntax in the following way, using the Japanese (ja) article on metagenomics (メタジェノミクス) as an example:
For an article to be accepted into the contest, it has to be approved by a user who actually understands that language, and by a member of the jury (the two can be identical). Translations from other Wikipedia languages are welcome but have to be indicated as such. Please add your claims (no more than two in total across the English and non-English competitions) below (please order them alphabetically, so that duplicates are easily detectable):