- SA@OSU Home
- →
- Browsing by Subject
JavaScript is disabled for your browser. Some features of this site may not work without it.
Browsing by Subject "Heuristic programming"
Now showing items 1-6 of 6
-
(Corvallis, OR : Oregon State University, Dept. of Computer Science, 2002)The meaning of biological sequences is a central problem of modern biology. Although string matching is well understood in the edit-distance model, biological strings with transpositions and inversions violate this mo ...
-
(Corvallis, OR : Oregon State University, Dept. of Computer Science, 1999)Approximate string matching is commonly used to align genetic sequences (DNA or RNA) to determine their shared characteristics. Most genetic string matching methods are based on the edit-distance model, which does not p ...
-
(2000-07-05)A hybrid landscape optimization/simulation model called SafeD (Simulation and analysis of forests with episodic Disturbances) was built to address the needs of forest management planning in the Applegate River Watershed, ...
-
(1997-08-11)Biologists need tools to see the structural relationships encoded in biological sequences (strings). The Walking Tree heuristics calculate some of these relationships. I have designed and implemented graphic presentati ...
-
(Corvallis, OR : Oregon State University, Dept. of Computer Science, 1998)Basic biological information is stored in strings of nucleic acids (DNA, RNA) or amino acids (proteins). Teasing out the meaning of these strings is a central problem of modern biology. Matching and aligning strings br ...
-
(2003-06-20)
Now showing items 1-6 of 6
