James R. Randall  Home/Search
Context
Related
| toronto.edu/pub/bonner/pap...thesis1.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: toronto.edu/~bonner/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This thesis is concerned with graph theory-based algorithms to handle the genetic map assembly problem. These algorithms are designed to build the genetic maps using only graph theoretical properties so as to better understand how much information can be obtained from the graph structure. In particular, several algorithms are developed using ideas from interval graphs and the asteroidal triple-free graphs. The core of the problem is dealing with the noise present in the data. This noise can be... (Update)
Active bibliography (related documents): More All
0.5: Revealing Hidden Interval Graph Structure in STS-Content Data - Harley, Bonner, Goodman (1998) (Correct)
0.5: Efficient Resource Scheduling in Multiprocessors - Chakrabarti (1996) (Correct)
0.3: Rethinking the DNA Fragment Assembly Problem - Meidanis (1993) (Correct)
Similar documents based on text: More All
0.1: Ethnography and collaborative systems development II.. - Randall, al. (1994) (Correct)
0.1: ( ) ( ) [ ] ( ) - Vt Vt Randall (Correct)
0.1: Theoretical Particle Physics 1995 Progress Report And Research.. - One Of (Correct)
BibTeX entry: (Update)
@misc{ randall-using,
author = "James R. Randall",
title = "Using Interval Graphs for Solving Map Assembly Problems",
url = "citeseer.ist.psu.edu/randall97using.html" }
Citations (may not include all citations):488 Algorithmic Graph Theory and Perfect Graphs (context) - Golumbic - 1980
178 Algorithmic aspects of vertex elimination of graphs (context) - Rose, Tarjan et al. - 1976
135 and graph planarity using PQ-tree algorithms (context) - Booth, Lueker et al. - 1976
59 Representation of a finite graph by a set of intervals on th.. (context) - Lekkerkerker, Boland - 1962
39 Asteroidal triple-free graphs - Corneil, Olariu et al. - 1997
38 An incremental linear-time algorithm for recognizing interva.. (context) - Korte, Mohring - 1989
31 Scientific American Books (context) - Watson, Gilman et al. - 1992
23 Genomic mapping by anchoring random clones: a mathematical a.. (context) - Arratia, Lander et al. - 1991
21 Linear time algorithms for dominating pairs in asteroidal tr.. - Corneil, Olariu et al. - 1998
13 The ultimate interval graph recognition algorithm - Corneil, Olariu et al. - 1998
10 An optimal greedy heuristic to color interval graphs (context) - Olariu - 1991
9 A flexible approach to genome map assembly - Harley, Bonner - 1994
8 Graph property update algorithms and their application to di.. (context) - Cheston, Corneil - 1982
6 Some aspects of perfect elimination orderings in chordal gra.. (context) - Shier - 1984
3 Principles of Genetics (context) - Tamarin, Leavitt - 1991
2 Good Maps are Straight - Harley, Bonner et al. - 1996
2 Personal communication (context) - Harley, Stein - 1996
1 A characterization of comparibility graphs and interval grap.. (context) - Gilmore, Hoffman - 1964
1 Private communication (context) - Corneil, Olariu et al. - 1996
Documents on the same site (http://www.cs.toronto.edu/~bonner/papers.html): More
Expressing Database Queries with Intuitionistic Logic - Bonner, McCarty, Vadaparty (1989) (Correct)
Concurrency and Communication in Transaction Logic - Bonner, Kifer (1996) (Correct)
Sequences, Datalog and Transducers - Mecca, Bonner (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC