We give an alphabet-independent optimal parallel algorithm for the searching phase of three dimensional pattern-matching. All occurrences of a three dimensional pattern P of shape m m m in a text T of shape nn n are to be found. Our algorithm works in log m time with O(N= log(m)) processors of a CREW PRAM, where N = n 3. The searching phase in three dimensions explores classiication of two-dime...

Despite consented efforts in prevention, mycotoxins remain a problem of human health concern in several parts of the world including developed countries. Within the same range of toxins concentrations in the blood some people develop a disease while others do not. Could this inequality in front of mycotoxins effects be explained by environment factors and/or genetic predisposition? Among recent...

Background Evidence on the management of pregnant patients with lupus activity is limited. The choice pharmacological treatment decisive for an adequate outcome. Objectives To show experience intravenous immunoglobulin (IVIG) in severe active lupus. Methods Case series from January 2020 to November 2022 being managed IVIG a hospital Bogotá, Colombia. Results Out total 33 evaluated during period...

like other developing countries, iranian cities are growing and expanding physically at a high speed. for about five decades, the only policy of the urban development plans in the field of urban growth management has been definition of the urban growth boundary (u.g.b.) which is still used without any major modifications.despite the slight evidences indicating the ineffectiveness of the current...

like other developing countries, iranian cities are growing and expanding physically at a high speed. for about five decades, the only policy of the urban development plans in the field of urban growth management has been definition of the urban growth boundary (u.g.b.) which is still used without any major modifications.despite the slight evidences indicating the ineffectiveness of the current...

We give an alphabet-independent optimal parallel algorithm for the searching phase of three-dimensional pattern-matching. All occurrences of a three dimensional pattern P of shape mmm in a text T of shape n n n are to be found. Our algorithm works in log m time with O(N= log(m)) processors of a CREW PRAM, where N = n 3. The ideas from 3] are used. Surprisingly, the extension of the two dimensio...