Modern routers use specialized hardware, such as Ternary Content Addressable Memory (TCAM), to solve the Longest Prefix Matching Problem (LPMP) quickly. Due to the fact that TCAM is a non-standard type of memory and inherently parallel, there are concerns about its cost and power consumption. This problem is exacerbated by the growth in routing tables, which demands ever larger TCAMs. To reduce the size of the TCAMs in a distributed forwarding environment, a batch caching model is proposed and analyzed. The problem of determining which routing prefixes to store in the TCAMs reduces to the In-tree Knapsack Problem (ITKP) for unit weight vertices in this model. Several algorithms are analysed for solving the ITKP, both in the general case and when the problem is restricted to unit weight vertices. Additionally, a variant problem is proposed and analyzed, which exploits the caching model to provide better solutions. This thesis concludes with discussion of open problems and future experimental work.

Modern routers use specialized hardware, such as Ternary Content Addressable Memory (TCAM), to solve the Longest Prefix Matching Problem (LPMP) quickly. Due to the fact that TCAM is a non-standard type of memory and inherently parallel, there are concerns about its cost and power consumption. This problem is exacerbated by the growth in routing tables, which demands ever larger TCAMs. To reduce the size of the TCAMs in a distributed forwarding environment, a batch caching model is proposed and analyzed. The problem of determining which routing prefixes to store in the TCAMs reduces to the In-tree Knapsack Problem (ITKP) for unit weight vertices in this model. Several algorithms are analysed for solving the ITKP, both in the general case and when the problem is restricted to unit weight vertices. Additionally, a variant problem is proposed and analyzed, which exploits the caching model to provide better solutions. This thesis concludes with discussion of open problems and future experimental work.

The accurate determination of gender of biological samples has valuable applications in medical and forensic investigations. Gender determination based on length variations in the X-Y homologous amelogenin gene, is part of most commercial multiplex DNA profiling kits. The first report of a failure of the amelogenin sex test was in 1998 when two normal males were typed as female. Subsequently, several amelogenin Y (AMELY) negative males have been reported. This study represents the first report of this phenomenon in the black South African population. This study determined the size of the Y-chromosome deletion that resulted in the failure of the amelogenin sex test in two black South African AMELY-negative males by typing specific DNA markers surrounding the amelogenin locus. Through deletion size and Y-chromosome microsatellite haplotypes, the relationship between the samples was investigated. The samples were sequenced at the amelogenin gene and typed for thirteen sites on the short arm of the Y-chromosome. In order to determine the Y-chromosome haplotypes, eleven Y-chromosome microsatellite markers were typed. These samples had the same size deletion of approximately 3 Mb. The Y-chromosome haplotypes indicated that these were probably independent events. The frequency of AMELY-negative males is rare in this population sample of 8,344 individuals, with a frequency of 0.065% in the black South African sample population. Notwithstanding, tests performed for detecting the presence of male DNA based on the presence of the amelogenin gene alone should be reconsidered, as this study confirms that these deletions do occur in the African population. The impact of the results generated in this study on the medical and forensic practise of DNA testing is significant. / Thesis (Ph.D. (Biochemistry))--North-West University, Potchefstroom Campus, 2011.

There are many practical decision problems that fall into the category of network flow problems: numerous examples of applications can be found in areas such as telecommunications, logistics, distributions, engineering, computer science and so on. One of the most popular and valuable tools to solve network flow problems of a topological nature is the use of linear programming models. An important extension of these models is that of integer programming models that deal with problems where some, or all, of the variables are required to assume integer variables. A significant application in this class of problems is the knapsack problem that arises in different contexts such as loading containers in aircraft or satisfying the demand for various lengths of cloth which must be cut from fixed length bolts of fabric. In this study, the feasibility of representing a network flow model in a tree network model and subsequently solving it using a tree knapsack approach is investigated. To compare and validate the proposed technique, a specific case study was chosen from the literature that can be used as a basis for the research project. The said study was an oil pipeline design problem, addressed by Brimberg et al. (2003). This focuses on the optimal design of an oil pipeline network for the South Gabon oil field in Africa. The objective was to reduce oil transportation costs to a major port. Following an overview of different network flow and knapsack models, an overview of the said matter is presented. A description of the proposed tree knapsack approach and the application of this approach to the given problem is given. Results have indicated that it is feasible to apply a tree knapsack approach to solve network flow problems. / Thesis (M.Sc. (Computer Science))--North-West University, Potchefstroom Campus, 2011.

The accurate determination of gender of biological samples has valuable applications in medical and forensic investigations. Gender determination based on length variations in the X-Y homologous amelogenin gene, is part of most commercial multiplex DNA profiling kits. The first report of a failure of the amelogenin sex test was in 1998 when two normal males were typed as female. Subsequently, several amelogenin Y (AMELY) negative males have been reported. This study represents the first report of this phenomenon in the black South African population. This study determined the size of the Y-chromosome deletion that resulted in the failure of the amelogenin sex test in two black South African AMELY-negative males by typing specific DNA markers surrounding the amelogenin locus. Through deletion size and Y-chromosome microsatellite haplotypes, the relationship between the samples was investigated. The samples were sequenced at the amelogenin gene and typed for thirteen sites on the short arm of the Y-chromosome. In order to determine the Y-chromosome haplotypes, eleven Y-chromosome microsatellite markers were typed. These samples had the same size deletion of approximately 3 Mb. The Y-chromosome haplotypes indicated that these were probably independent events. The frequency of AMELY-negative males is rare in this population sample of 8,344 individuals, with a frequency of 0.065% in the black South African sample population. Notwithstanding, tests performed for detecting the presence of male DNA based on the presence of the amelogenin gene alone should be reconsidered, as this study confirms that these deletions do occur in the African population. The impact of the results generated in this study on the medical and forensic practise of DNA testing is significant. / Thesis (Ph.D. (Biochemistry))--North-West University, Potchefstroom Campus, 2011.

There are many practical decision problems that fall into the category of network flow problems: numerous examples of applications can be found in areas such as telecommunications, logistics, distributions, engineering, computer science and so on. One of the most popular and valuable tools to solve network flow problems of a topological nature is the use of linear programming models. An important extension of these models is that of integer programming models that deal with problems where some, or all, of the variables are required to assume integer variables. A significant application in this class of problems is the knapsack problem that arises in different contexts such as loading containers in aircraft or satisfying the demand for various lengths of cloth which must be cut from fixed length bolts of fabric. In this study, the feasibility of representing a network flow model in a tree network model and subsequently solving it using a tree knapsack approach is investigated. To compare and validate the proposed technique, a specific case study was chosen from the literature that can be used as a basis for the research project. The said study was an oil pipeline design problem, addressed by Brimberg et al. (2003). This focuses on the optimal design of an oil pipeline network for the South Gabon oil field in Africa. The objective was to reduce oil transportation costs to a major port. Following an overview of different network flow and knapsack models, an overview of the said matter is presented. A description of the proposed tree knapsack approach and the application of this approach to the given problem is given. Results have indicated that it is feasible to apply a tree knapsack approach to solve network flow problems. / Thesis (M.Sc. (Computer Science))--North-West University, Potchefstroom Campus, 2011.