|Budget Amount *help
¥3,100,000 (Direct Cost : ¥3,100,000)
Fiscal Year 1999 : ¥1,400,000 (Direct Cost : ¥1,400,000)
Fiscal Year 1998 : ¥1,700,000 (Direct Cost : ¥1,700,000)
A mathematical theory for the subject on ancestral character-state reconstructions under the maximum parsimony in phylogeny has been developing. Recently, a clear method for the subject under a given el-tree has been presented by Hanazawa and Narushima (1995, 1997).
In the framework based on the method, Narushima and Misheva have refined and generalized the ACCTRAN reconstruction originated with Farris (1970) and defined more explicitly by Swofford and Maddison (1987), which is considered a more meaningful and useful one of the many possible most-parsimonious reconstructions (abbreviated to MPRs). Then Narushima and Misheva have showed the subtree-complete maximum-parsimonity of ACCTRAN reconstructions, and Narushima has showed another remarkable property, that is, the extremal property, of ACCTRAN reconstructions.
Furthermore, Miyakawa and Narushima have mathematically defined and generalized the MPR-poset of all MPRs, which is introduced by Minaka (1993), and then have showed the following theorems on MPR-posets : 1) an usual MPR-poset is a complete distributive lattice, 2) a σ (r)-version MPR-poset is a lower-complete semilattice, 3) any interval poset of a σ (r)-version MPR-poset is a complete distributive lattice. And also, some properties of the distortion index on all MPRs have been clarified with the ACCTRAN reconstruction.
On the other hand, Hanazawa and Narushima have given an efficient algorithm for MPR-problems on unicycle graphs.