Search results for: Asraful%20Islam
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 2

Search results for: Asraful%20Islam

2 Antagonistic Potential of Trichoderma Strains against Colletotrichum musae

Authors: Shah Md. Asraful Islam, Shabina Yeasmin, Fatima Aktar Mousumi

Abstract:

The experiment was conducted to evaluate the antagonistic potential of three commercially available Trichoderma strains viz., T. harzianum (armigera), T. harzianum (Ispahani), and T. viride against Colletotrichum musae isolates from three banana varieties viz., sagar, sobri, and katali. Mycelial growth rates of C. musae isolates were observed, the highest mycelial growth (11.62, 15.75, and 23.12 mm diameter) was observed by C. musae from sagor banana at 1, 2 and 3 days after inoculation, respectively. All the Trichoderma strains were capable of growth inhibition of C. musae isolates. After 4 days of duel culture, the highest mycelial growth reduction (10.33 mm diameter) was observed by the interaction between T. harzianum (armigera) with C. musae from sagor banana. Moreover, the highest growth inhibition (46.29%) was observed by the interaction between T. harzianum (armigera) with C. musae from the sobri banana. All the Trichoderma strains fully affected the viability of all the Colletotrichum isolates. Interestingly, both cultural filtrates and mycelial powders of all the Trichoderma strains showed a very nice inhibitory effect against C. musae isolates, where cultural filtrates were more potential than that of mycelial powders. So, all the tested Trichoderma strains may be used for the control of banana anthracnose disease.

Keywords: biological control, banana, anthracnose, Trichoderma, Colletotrichum

Procedia PDF Downloads 95
1 Characterising Stable Model by Extended Labelled Dependency Graph

Authors: Asraful Islam

Abstract:

Extended dependency graph (EDG) is a state-of-the-art isomorphic graph to represent normal logic programs (NLPs) that can characterize the consistency of NLPs by graph analysis. To construct the vertices and arcs of an EDG, additional renaming atoms and rules besides those the given program provides are used, resulting in higher space complexity compared to the corresponding traditional dependency graph (TDG). In this article, we propose an extended labeled dependency graph (ELDG) to represent an NLP that shares an equal number of nodes and arcs with TDG and prove that it is isomorphic to the domain program. The number of nodes and arcs used in the underlying dependency graphs are formulated to compare the space complexity. Results show that ELDG uses less memory to store nodes, arcs, and cycles compared to EDG. To exhibit the desirability of ELDG, firstly, the stable models of the kernel form of NLP are characterized by the admissible coloring of ELDG; secondly, a relation of the stable models of a kernel program with the handles of the minimal, odd cycles appearing in the corresponding ELDG has been established; thirdly, to our best knowledge, for the first time an inverse transformation from a dependency graph to the representing NLP w.r.t. ELDG has been defined that enables transferring analytical results from the graph to the program straightforwardly.

Keywords: normal logic program, isomorphism of graph, extended labelled dependency graph, inverse graph transforma-tion, graph colouring

Procedia PDF Downloads 175