Also found in: Thesaurus, Medical, Encyclopedia, Wikipedia.


1. Biology Having a similar structure or appearance but being of different ancestry.
2. Related by an isomorphism.


(ˌaɪsəʊˈmɔːfɪk) or


(Biochemistry) exhibiting isomorphism


(ˌaɪ səˈmɔr fɪk)

1. Biol. having the same form or appearance.
3. Math. pertaining to two sets related by an isomorphism.
ThesaurusAntonymsRelated WordsSynonymsLegend:
Adj.1.isomorphic - having similar appearance but genetically different
biological science, biology - the science that studies living organisms


[ˌaɪsəʊˈmɔːfɪk] ADJisomorfo


adj (form)isomorph


[ˌaɪsəʊˈmɔːfɪk] isomorphous [ˌaɪsəʊˈmɔːfəs] adjisomorfo/a
References in periodicals archive ?
Hence, each EC isomorphic to [E.sub.p,b] will generate a distinct S-box.
Moreover, they proved that the spaces [F.sup.2.sub.(n)](C) are isomorphic and isometric to [L.sub.2](R) [R] [cross product] [H.sub.n-1], where [H.sub.n-1] is the one-dimensional space generated by Hermite function of order n - 1.
They prove that every subgroup of the multiplicative semigroup of n x n finite tropical matrices is isomorphic to a direct product of the form R x [SIGMA] for some [SIGMA] [less than or equal to] [S.sub.n].
Are there any corresponding policies or measures that Chinese governments can take to allow isomorphic diffusion progress?
If for each group H such that the monoids End(G) and End(H) are isomorphic implies an isomorphism between G and H, we say that the group G is determined by its endomorphism monoid in the class of all groups.
By being in three fields at the same time, the strategies of these firms are said not to be limited any one of them, enabling them to largely ignore the isomorphic pressures of their host environments.
The authors showed that G[u.sub., n] was the disjoint union of isomorphic copies of their special subgraph [F.sub.u, n], the generalized Farey graph, coming from the use of the subgroup [[GAMMA].sub.0] (n) of [GAMMA].
If an m-polar fuzzy graph [G.sub.1] is coweak isomorphic to [G.sub.2] and if [G.sub.1] is regular then [G.sub.2] is also regular.
Two signed graphs [S.sub.1] and [S.sub.2] are cycle isomorphic if there exists an isomorphism f : [greater than or equal to]1 [right arrow] [[SIGMA].sub.2], where [[SIGMA].sub.1] and [[SIGMA].sub.2] are underlying graph of [S.sub.1] and [S.sub.2], respectively, such that the sign of every cycle [SIGMA] in [S.sub.1] equals the sign of f(Z) in [S.sub.2].
(d) If [absolute value of G] = 3, then G is isomorphic to [K.sub.3]; if [absolute value of G] = 4, then G is isomorphic to [K.sub.4]; if [absolute value of G] = 5, then G is isomorphic to [K.sub.5]-e, where [member of] is any edge of [K.sub.5].
Then G is isomorphic to [mathematical expression not reproducible] or [mathematical expression not reproducible], where [mathematical expression not reproducible] denotes the union of k > 0 disjoint cycles [mathematical expression not reproducible] of length [k.sub.i].
If p [not equal to] 0, then [H.sub.n] (p, q) is isomorphic to the Drinfeld double D([A.sub.n] ([q.sup.-1])) of the Taft algebra [A.sub.n] ([q.sup.-1] ).