Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/34824

Title: Algorithms for book crossing number problems
Authors: He, Hongmei
Issue Date: 2006
Publisher: © Hongmei He
Abstract: The crossing minimisation problem is of outmost importance in the field of graph drawings. The aesthetical properties and readability of graphs are heavily dependent on the number of crossings in a drawing. Moreover, crossing minimisation is the most important goal in the linear Very Large Scale Integration (VLSI) circuit design and Quantum-dot Cellular Automata (QCA), since smaller crossing number means lower cost. Another application is for the problem of computing an mRNA sequence of maximal codon-wise similarity to a given mRNA (MRSO problem) in bioinformatics computing. [Continues.]
Description: A Doctoral Thesis. Submitted in partial fulfilment of the requirements for the award of Doctor of Philosophy at Loughborough University.
Sponsor: EPSRC (grant no.: GR/S76694/01).
URI: https://dspace.lboro.ac.uk/2134/34824
Appears in Collections:PhD Theses (Computer Science)

Files associated with this item:

File Description SizeFormat
Thesis-2006-He.pdf5.37 MBAdobe PDFView/Open
Form-2006-He.pdf48.55 kBAdobe PDFView/Open

 

SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.