| EPSRC Reference: |
GR/L19362/01 |
| Title: |
DESIGN OF ALGORITHMS FOR SEQUENCE ANALYSIS |
| Principal Investigator: |
Iliopoulos, Professor C |
| Other Investigators: |
|
| Researcher Co-Investigators: |
|
| Project Partners: |
|
| Department: |
Computer Science |
| Organisation: |
Kings College London |
| Scheme: |
Standard Research (Pre-FEC) |
| Starts: |
12 June 1996 |
Ends: |
11 March 1997 |
Value (£): |
9,100
|
| EPSRC Research Topic Classifications: |
|
| EPSRC Industrial Sector Classifications: |
|
| Related Grants: |
|
| Panel History: |
|
|
Summary on Grant Application Form |
|
The proposed research focuses on the family of twin repetitions problems in stringology. Our interest in these general problems in strong motivated by a specific application within molecular biology. The practical requirement is to check whether a recipient is likely to accept or to reject a donor's organ in a transplant operation. If the amino acid composition of a protein differs, the recipient's immune system may regard the donor's organ as foreign and reject it. There is an urgent need for new string algorithmic techniques that efficiently assess whether donor/recipient differences are so great that a transplant should not be undertaken. New methods will substantially reduce the time complexity.Key Words: Design of Algorithms, String Algorithms, Molecular Sequence Analysis.
|
|
Key Findings |
|
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
|
|
Potential use in non-academic contexts |
|
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
|
|
Impacts |
|
| Description |
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk |
| Summary |
|
| Date Materialised |
|
|
|
|
Sectors submitted by the Researcher |
|
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
|
| Project URL: |
|
| Further Information: |
|
| Organisation Website: |
|