CRISTINA POP   Home Resume Academics Projects Personal Contact



Highlighted below are some of the interesting projects I have been involved in as part of project courses, research, or my own distractions.


Prediction Algorithms for RNA Secondary Structure

Developed over two summers under Undergraduate Summer Research Awards at UBC


Energy of predicted structure,
using different energy models.

Arc diagram representation of pseudoknot with nested structures.
This set of programs predict pseudoknotted RNA secondary structures (the way ribonucleic acid strands fold on themselves in complex, knotted motifs).

Various stages of this work were presented at:
- Bioinformatics Reading Group at UBC
- RiboWest 2006 in Prince George, BC and the UBC/CS Bioinformatics-Industry Day (pdf)
- RiboWest 2007 in Prince George, BC

- ghci
- hugs
- Eclipse

Programming Languages:
- Haskell
- C, C++
- Perl


Online Collaboration Tool for Editing Documents and Chatting

Developed for a project course
(EECE 419 at UBC)

Login screen for users.
Project screen displaying participants, chat screen and buttons for document editing.
Distributed collaboration tool that allows:
- users to create projects
- one user to act as the chair of a project
- users to chat within a project
- users to take turns editing documents in real time

- Eclipse

Programming Languages:
- Java


Travel Journal from Trip to Romania (Summer 2005)

Developed for fun


A busy street in Cluj.
A multi-page picture tour of my trip to Romania.

- Microsoft Visual Studio .NET


Summer Research on Graph Theory

Developed under an Undergraduate Summer Research Award at UBC


Ramanujan Graphs and their 2-Fold Covers

Supervisor: Dr. Joel Friedman
Mathematics Department, UBC


Abstract: In this paper, a graph is discussed as being Ramanujan if its second largest eigenvalue, calculated from its adjacency matrix, follows the relation λ2 ≤ 2√(d-1). Several tests were performed regarding the percentage of Ramanujan graphs and covers, but the main focus was on the relationship between the signed cover and the base eigenvalues. Numerical tests done on d-regular Ramanujan graphs show that there is a threshold base eigenvalue where a good base expander has a greater chance of doing worse as a cover (i.e. the signed cover highest eigenvalue is greater than the base graph λ2) then turns to a decent base expander that has a greater chance of doing no worse as a cover (i.e. the signed cover highest eigenvalue is smaller than the base graph λ2). This threshold depends on both the degree of the vertices and the number of vertices, in that the threshold increases as these two quantities do.
The goal of this project was to investigate the Ramanujan property that makes graphs beneficial to applications such as computer networks. Matlab and C++ programs were created to generate and analyze graphs with this property.

The project report is available

- Matlab and C++


Home Resume Academics Projects Personal Contact


Last Updated: January 2011