Please use this identifier to cite or link to this item:
https://idr.l2.nitk.ac.in/jspui/handle/123456789/7694Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Navada, K.C. | - |
| dc.contributor.author | Sekaran, K.C. | - |
| dc.date.accessioned | 2020-03-30T10:02:39Z | - |
| dc.date.available | 2020-03-30T10:02:39Z | - |
| dc.date.issued | 2006 | - |
| dc.identifier.citation | Proceedings - 2006 14th International Conference on Advanced Computing and Communications, ADCOM 2006, 2006, Vol., , pp.318-320 | en_US |
| dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/7694 | - |
| dc.description.abstract | It is observed that during the evolution of species, reticulation is an important event and is very prevalent in several organisms. However, the analytical tools for the representation of these events are still under development. This is primarily because of the difficulty involved in detecting these reticulation events that have taken place during the evolution using the sequences that are currently available in some form. Since it is not possible to get each sequence starting from the root (beginning of the evolution process), inferring the history has to be based on a few assumptions, which are biologically valid. In this paper, we propose an algorithm which, we feel, is a step in this direction. The algorithm detects the sequences which require reticulation events for their formation and returns the count of such sequences. � 2006 IEEE. | en_US |
| dc.title | Detection of reticulation events - A character based method | en_US |
| dc.type | Book chapter | en_US |
| Appears in Collections: | 2. Conference Papers | |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.