Molecular characterization and phylogenetic analysis of a penaeidin-like antimicrobial peptide, Fi-penaeidin from Fenneropenaeus indicus

Antimicrobial peptides (AMPs) play a major role in innate immunity. Penaeidins are a family of AMPs that appear to be expressed in all penaeid shrimps. Penaeidins are composed of an N-terminal proline-rich domain, followed by a C-terminal domain containing six cysteine residues organized in two doublets. This study reports the first penaeidin AMP sequence, Fi-penaeidin (GenBank accession number HM243617) from the Indian white shrimp, Fenneropenaeus indicus. The full length cDNA consists of 186 base pairs encoding 61 amino acidswith an ORF of 42 amino acids and contains a putative signal peptide of 19 amino acids. Comparison of F. indicus penaeidin (Fi-penaeidin) with other known penaeidins showed that it shared maximum similarity with penaeidins of Farfantepenaeus paulensis and Farfantepenaeus subtilis (96% each). Fi-penaeidin has a predicted molecular weight (MW) of 4.478 kDa and theoretical isoelectric point (pI) of 5.3

Median Sets and Median Number of a Graph

A profile is a finite sequence of vertices of a graph. The set of all vertices of the graph which minimises the sum of the distances to the vertices of the profile is the median of the profile. Any subset of the vertex set such that it is the median of some profile is called a median set. The number of median sets of a graph is defined to be the median number of the graph. In this paper, we identify the median sets of various classes of graphs such as Kp − e, Kp,q forP > 2, and wheel graph and so forth. The median numbers of these graphs and hypercubes are found out, and an upper bound for the median number of even cycles is established.We also express the median number of a product graph in terms of the median number of their factors.

Median graphs, the remoteness function, periphery transversals, and geodetic number two

A periphery transversal of a median graph G is introduced as a set of vertices that meets all the peripheral subgraphs of G. Using this concept, median graphs with geodetic number 2 are characterized in two ways. They are precisely the median graphs that contain a periphery transversal of order 2 as well as the median graphs for which there exists a profile such that the remoteness function is constant on G. Moreover, an algorithm is presented that decides in O(mlog n) time whether a given graph G with n vertices and m edges is a median graph with geodetic number 2. Several additional structural properties of the remoteness function on hypercubes and median graphs are obtained and some problems listed