Set is a fundamental, abstract notion. A set is defined as a collection of objects, which are called the elements or points of the set. The notions of union (\(A \cup B\), where \(A\) and \(B\) are each sets), intersection (\(A \cap B\)), and complement (\(A^c\)) correspond to everyday usage. Thus, if \(A = \{ a,b\}\) and \(B = \{ b,c\}\), \(A \cup B = \{ a,b,c\}\), \(A \cap B = \{ b\}\), and \(A^c = \{ c,d,\dots ,z\}\) if our world is the English alphabet. Functions can be thought of as operations that map one set onto another.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2009 Springer-Verlag London
About this chapter
Cite this chapter
Ramsden, J.J. (2009). Sets and Combinatorics. In: Bioinformatics. Computational Biology, vol 10. Springer, London. https://doi.org/10.1007/978-1-84800-257-9_4
Download citation
DOI: https://doi.org/10.1007/978-1-84800-257-9_4
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-84800-256-2
Online ISBN: 978-1-84800-257-9
eBook Packages: Computer ScienceComputer Science (R0)