OSCR

Cyphers and cycles - A chemical basis of the differential attraction of mosquitoes to human odor.

Code ↔ Paper

The paper beside its authors' code: matches between them have not been computed for this paper yet.

Paper

Loaded from Europe PMC by your browser, not stored by OSCR: doi.org · Europe PMC

The paper is loaded when this pane is shown.

The authors' code

C/C++ header · 130 lines · 5 KB · no license

  1. /**
  2. * Copyright (C) 2008,2010 Ellis Whitehead
  3. *
  4. * This program is free software: you can redistribute it and/or modify
  5. * it under the terms of the GNU General Public License as published by
  6. * the Free Software Foundation, either version 3 of the License, or
  7. * (at your option) any later version.
  8. *
  9. * This program is distributed in the hope that it will be useful,
  10. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. * GNU General Public License for more details.
  13. *
  14. * You should have received a copy of the GNU General Public License
  15. * along with this program. If not, see <http://www.gnu.org/licenses/>.
  16. */
  17. #ifndef __CHECK_H
  18. #define __CHECK_H
  19. class QString;
  20. /// checkFailure() is called by the CHECK_* macros when a check fails
  21. /// This function will need to be implemented somewhere in the application code
  22. /// in order to handle a check failure sensibly.
  23. extern void checkFailure(const char* sFile, int iLine, const char* s);
  24. extern void checkLog(const char* sFile, int iLine, const QString& sType, const QString& sMessage);
  25. // Only define checkFailure()
  26. //#ifdef QT_NO_DEBUG
  27. #if 0
  28. #define __CHECK_COND_RETVAL(x, ret) \
  29. { if ((x) == false) { return (ret); } }
  30. #define __CHECK_COND_RET(x) \
  31. { if ((x) == false) { return; } }
  32. #define __CHECK_COND_NORET(x) \
  33. { }
  34. /// Check a precondition, and return the given value if the check fails
  35. #define CHECK_PRECOND_RETVAL(x, ret) __CHECK_COND_RETVAL(x, ret)
  36. /// Check a precondition, and return if the check fails
  37. #define CHECK_PRECOND_RET(x) __CHECK_COND_RET(x)
  38. /// Check a parameter for validity, and return the given value if the check fails
  39. #define CHECK_PARAM_RETVAL(x, ret) __CHECK_COND_RETVAL(x, ret)
  40. /// Check a parameter for validity, and return if the check fails
  41. #define CHECK_PARAM_RET(x) __CHECK_COND_RET(x)
  42. /// Check a condition for validity, and return the given value if the check fails
  43. #define CHECK_ASSERT_RETVAL(x, ret) __CHECK_COND_RETVAL(x, ret)
  44. /// Check a condition for validity, and return if the check fails
  45. #define CHECK_ASSERT_RET(x) __CHECK_COND_RET(x)
  46. /// Check a condition for validity, and just print debug info if the check fails
  47. #define CHECK_ASSERT_NORET(x) __CHECK_COND_NORET(x)
  48. #define CHECK_FAILURE_RETVAL(ret) \
  49. { return (ret); }
  50. #define CHECK_FAILURE_RET() \
  51. { return; }
  52. #else
  53. #define LOG(nDebugLevel, s) checkLog(__FILE__, __LINE__, "LOG", s)
  54. #define __CHECK_COND_RETVAL(x, ret) \
  55. { if ((x) == false) { checkFailure(__FILE__, __LINE__, #x); return ret; } }
  56. #define __CHECK_COND_RET(x) \
  57. { if ((x) == false) { checkFailure(__FILE__, __LINE__, #x); return; } }
  58. #define __CHECK_COND_NORET(x) \
  59. { if ((x) == false) { checkFailure(__FILE__, __LINE__, #x); } }
  60. /// Check a precondition, and return the given value if the check fails
  61. #define CHECK_PRECOND_RETVAL(x, ret) __CHECK_COND_RETVAL(x, ret)
  62. /// Check a precondition, and return if the check fails
  63. #define CHECK_PRECOND_RET(x) __CHECK_COND_RET(x)
  64. /// Check a precondition and continue without returning
  65. #define CHECK_PRECOND_NORET(x) __CHECK_COND_NORET(x)
  66. /// Check a parameter for validity, and return the given value if the check fails
  67. #define CHECK_PARAM_RETVAL(x, ret) __CHECK_COND_RETVAL(x, ret)
  68. /// Check a parameter for validity, and return if the check fails
  69. #define CHECK_PARAM_RET(x) __CHECK_COND_RET(x)
  70. /// Check a parameter for validity and continue without returning
  71. #define CHECK_PARAM_NORET(x) __CHECK_COND_NORET(x)
  72. /// Check a condition for validity, and return the given value if the check fails
  73. #define CHECK_ASSERT_RETVAL(x, ret) __CHECK_COND_RETVAL(x, ret)
  74. /// Check a condition for validity, and return if the check fails
  75. #define CHECK_ASSERT_RET(x) __CHECK_COND_RET(x)
  76. /// Check a condition for validity, and just print debug info if the check fails
  77. #define CHECK_ASSERT_NORET(x) __CHECK_COND_NORET(x)
  78. #define CHECK_FAILURE_RETVAL(ret) \
  79. { checkFailure(__FILE__, __LINE__, ""); return (ret); }
  80. #define CHECK_FAILURE_RET() \
  81. { checkFailure(__FILE__, __LINE__, ""); return; }
  82. #endif
  83. #define IS_UINT8(n) (n >= 0 && n <= 0xff)
  84. #define IS_INT16(n) (n >= -32768 && n <= 0x7fff)
  85. /*
  86. #ifdef __cplusplus
  87. inline uint8 C_UINT8(int16 n) { CHECK_ASSERT_RETVAL(n <= 255 && n >= 0, 0); return (uint8) n; }
  88. inline uint8 C_UINT8(uint16 n) { CHECK_ASSERT_RETVAL(n <= 255, 0); return (uint8) n; }
  89. //inline uint8 C_UINT8(int n) { CHECK_ASSERT_RETVAL(n <= 255 && n >= 0, 0); return (uint8) n; }
  90. inline int16 C_INT16(uint16 n) { CHECK_ASSERT_RETVAL(n <= 0x7fff, 0); return (int16) n; }
  91. inline int16 C_INT16(uint32 n) { CHECK_ASSERT_RETVAL(n <= 0x7fff, 0); return (int16) n; }
  92. inline int16 C_INT16(float32 n) { CHECK_ASSERT_RETVAL(n >= -32768 && n <= 0x7fff, 0); return (int16) n; }
  93. inline uint16 C_UINT16(int32 n) { CHECK_ASSERT_RETVAL(n <= 0xffff, 0); return (int16) n; }
  94. inline uint16 C_UINT16(uint32 n) { CHECK_ASSERT_RETVAL(n <= 0xffff, 0); return (uint16) n; }
  95. inline uint16 C_UINT16(float32 n) { CHECK_ASSERT_RETVAL(n <= 0xffff, 0); return (uint16) n; }
  96. #endif
  97. */
  98. #endif

Check.h at commit f4680fb, no license · at the source

Overview

Authors: Annika Hinze1, Anaïs Karine Tallon1, Betelehem Wondwosen2, Mengistu Dawit1, Sharon Rose Hill1, Björn Bohman1, Rickard Ignell1
  1. Unit of Chemical Ecology, Department of Plant Protection Biology, Swedish University of Agricultural Sciences, Alnarp, Sweden
  2. Department of Zoological Sciences, Addis Ababa University, Addis Ababa, Ethiopia
Journal: iScience, volume 29, issue 5, article 115575
Dates: received 1 December 2025; accepted 30 March 2026; published online 2 April 2026
Type: Research article · Language: English
License: CC BY
Identifiers: DOI 10.1016/j.isci.2026.115575 · PMID 42063565 · PMCID PMC13127324 · OpenAlex W7148592388
Open access: gold, a free copy (OpenAlex)
Status: code verified
Categories: human (organism)
Methods: Statistics, Machine learning
Keywords: Biological sciences, Entomology, Chemical Ecology, Chemical Biology, Chemistry
Topic: Neurobiology and Insect Physiology Research (Cellular and Molecular Neuroscience, Neuroscience), according to OpenAlex
Citations: cited by 1 paper (Europe PMC); 90 references in the paper

Abstract

Anthropophilic mosquitoes, such as the yellow fever mosquito, Aedes aegypti, not only exhibit a robust host preference for humans but are also known to favor certain individuals over others, which has been attributed to variations in individual body odor. The underpinning chemical drivers, however, remain largely unidentified. Here, we assessed the differential attractiveness of 42 female participants to host-seeking Ae. aegypti, demonstrating that pregnancy or menstrual cycle phase significantly contributed to the individual level of attractiveness. Chemical and electrophysiological analyses of whole body odor samples identified 27 volatile organic compounds (VOCs) potentially involved in regulating the level of human attractiveness to mosquitoes. Behavioral assays further demonstrated that 1-octen-3-ol—present in the body odor of highly attractive participants and pregnant individuals—and the overall blend ratio of VOCs are sufficient to modulate mosquito preferences. Our findings suggest that multiple chemical motifs contribute to the heterogeneity in human attractiveness to mosquitoes.

Reproduced under the paper's license (CC BY), from the paper cited above.

Repository

Its files are read in the Code ↔ Paper reader above.

ellis/gcead

License: none: the authors keep all their rights
State: the link answers, verified on 28 September 2026
Evidence: files inventoried
Commit: f4680fb97b35f3edf91bfa98a7b5aee1f08a5365, 20 April 2017
Languages: C/C++ (187), C++ (174), Shell (6), C (1)
Size: 583 files, 368 scripts
Software Heritage: archived
Found in: the text, “Key resources table”
Holds: README
Not found: license file, CITATION.cff, environment file, tests, continuous integration, documentation
Availability: 1 check, the latest on 28 September 2026: the link answers
  • 28 September 2026: the link answers
369 files

The paper's code and data availability statement is in the Data section.

Tracing map

Proposed by the machine: these links were found in the paper and verified at the source, without human review. The map will receive a Zenodo DOI once one of the paper's authors has validated it with their ORCID.

What the map holds:

  • 1 repository of the authors' code, each at its verified commit, with its license and how the link was found in the paper;
  • 368 scripts, each with its path and the digest of its content;
  • no match between paragraphs and code yet;
  • neither the text of the paper nor the code itself.

Its JSON (tracing-map.json) is deposited on Zenodo with its DOI once the map is validated.

Data

No dataset and no data link were found in the paper.

Data and code availability

• De-identified data supporting these analyses have been deposited at the Swedish National Data Service repository at https://doi.org/10.5878/vh3n-xm78 and are publicly available as of the date of publication. Accession numbers are listed in the key resources table. • This paper does not report original code. • Any additional information required to reanalyze the data reported in this paper is available from the lead contact upon request.

Reproduced under the paper's license (CC BY), from the paper cited above.

Versions

The history of this record: each version stored by the harvester or made by a correction of its authors or of the maintainers of its code, and what changed in its facts. The texts of the paper (its abstract, its availability statements) are not part of it; versions that changed only those are not listed.

Version 2, 28 September 2026

  • Authors: added Rickard Ignell (0000-0002-4607-5986); removed Rickard Ignell

Version 1, 28 September 2026: the first record

Recorded: type, language, journal, volume, issue, pages, dates, 7 authors, 5 keywords, 1 funder, 86 references.

Cite

This paper

Hinze, A., Tallon, A. K., Wondwosen, B., Dawit, M., Hill, S. R., Bohman, B., & Ignell, R. (2026). Cyphers and cycles - A chemical basis of the differential attraction of mosquitoes to human odor. iScience, 29(5), 115575. https://doi.org/10.1016/j.isci.2026.115575

BibTeX

@article{hinze2026cyphers,
author = {Hinze, Annika and Tallon, Anaïs Karine and Wondwosen, Betelehem and Dawit, Mengistu and Hill, Sharon Rose and Bohman, Björn and Ignell, Rickard},
title = {{Cyphers and cycles - A chemical basis of the differential attraction of mosquitoes to human odor}},
journal = {iScience},
year = {2026},
month = apr,
volume = {29},
number = {5},
pages = {115575},
publisher = {Elsevier},
issn = {2589-0042},
doi = {10.1016/j.isci.2026.115575},
url = {https://doi.org/10.1016/j.isci.2026.115575},
pmid = {42063565},
pmcid = {PMC13127324}
}

RIS

TY - JOUR
AU - Hinze, Annika
AU - Tallon, Anaïs Karine
AU - Wondwosen, Betelehem
AU - Dawit, Mengistu
AU - Hill, Sharon Rose
AU - Bohman, Björn
AU - Ignell, Rickard
TI - Cyphers and cycles - A chemical basis of the differential attraction of mosquitoes to human odor
T2 - iScience
J2 - iScience
PY - 2026
DA - 2026/04/02
VL - 29
IS - 5
SP - 115575
SN - 2589-0042
PB - Elsevier
DO - 10.1016/j.isci.2026.115575
UR - https://doi.org/10.1016/j.isci.2026.115575
LA - en
ER -

CSL-JSON

{
"id": "10.1016/j.isci.2026.115575",
"type": "article-journal",
"title": "Cyphers and cycles - A chemical basis of the differential attraction of mosquitoes to human odor",
"container-title": "iScience",
"author": [
{
"family": "Hinze",
"given": "Annika"
},
{
"family": "Tallon",
"given": "Anaïs Karine"
},
{
"family": "Wondwosen",
"given": "Betelehem"
},
{
"family": "Dawit",
"given": "Mengistu"
},
{
"family": "Hill",
"given": "Sharon Rose"
},
{
"family": "Bohman",
"given": "Björn"
},
{
"family": "Ignell",
"given": "Rickard"
}
],
"container-title-short": "iScience",
"volume": "29",
"issue": "5",
"page": "115575",
"DOI": "10.1016/j.isci.2026.115575",
"PMID": "42063565",
"PMCID": "PMC13127324",
"ISSN": "2589-0042",
"publisher": "Elsevier",
"URL": "https://doi.org/10.1016/j.isci.2026.115575",
"language": "en",
"issued": {
"date-parts": [
[
2026,
4,
2
]
]
}
}

The tracing map gets a citation of its own once an author has validated it and it has a DOI.

Similar papers

The papers with a page that share the most with this one: the tools found in their code, their categories, datasets, cited references and authors, the rarest counting most.

[1] doi:10.1371/journal.pbio.3003959 [code]
Recurrent synapses between CO2-sensitive olfactory sensory neurons enable robust CO2 detection in Aedes aegypti mosquitoes.
Journal: PLoS biology
In common: 3 references
[2] doi:10.1038/s41467-026-76682-2 [code]
Odorant receptor coexpression and multi-expression in the dengue mosquito.
Journal: Nature communications
In common: 3 references
[3] doi:10.1371/journal.pbio.3003955 [code]
Beat- and Side-family cell-surface molecules are expressed combinatorially in the partner neurons of the olfactory circuit in Drosophila.
Journal: PLoS biology
In common: 2 references
[4] doi:10.1007/s44297-026-00082-7
Functional conservation of IR75q.2 in the recognition of volatile acids and aldehydes in two Spodoptera species.
Journal: Crop health
In common: 1 reference
[5] doi:10.7554/elife.110936
Crickets evade bats via olfaction beyond acoustic cues.
Journal: eLife
In common: 1 reference

Contribute

The authors of this paper can claim it, correct its record and validate its tracing map, and the maintainers of its code (its owner, or a public member of its organization) correct what it says of their repository; anyone signed in can ask for its removal. Every request goes to OSCR's own machine, which answers it; your account page follows them.

Sign in with ORCID to claim this paper as one of its authors, correct its record or validate its tracing map: when the paper's metadata lists your ORCID iD, you are recognized at once. Maintainers of its code: sign in with GitHub, then claim the repository on your account page.

Request its removal

To ask OSCR to remove this record, the copies of its authors' scripts or its tracing map, use the removal request page: signed in, you say who you are, what to remove and why, then review and confirm the request. Published rules decide every request (how).

Discussion, reproductions, activity

Discussion: questions and error reports about this paper and its code, from signed-in readers and its authors. It opens with sign-in.

Reproductions: reports from readers who ran the authors' code: what they reproduced, with which environment, commit and data. It opens with sign-in.

Activity: what happens around this paper: new versions of its record, its map's validation, discussions and reproductions. It opens with sign-in.