A non-parametric vessel detection method for complex vascular structures

Modern medical imaging techniques enable the acquisition of in vivo high resolution images of the vascular system. Most common methods for the detection of vessels in these images, such as multiscale Hessian-based operators and matched filters, rely on the assumption that at each voxel there is a single cylinder. Such an assumption is clearly violated at the multitude of branching points that are easily observed in all, but the Most focused vascular image studies. In this paper, we propose a novel method for detecting vessels in medical images that relaxes this single cylinder assumption. We directly exploit local neighborhood intensities and extract characteristics of the local intensity profile (in a spherical polar coordinate system) which we term as the polar neighborhood intensity profile. We present a new method to capture the common properties shared by polar neighborhood intensity profiles for all the types of vascular points belonging to the vascular system. The new method enables us to detect vessels even near complex extreme points, including branching points. Our method demonstrates improved performance over standard methods on both 2D synthetic images and 3D animal and clinical vascular images, particularly close to vessel branching regions. (C) 2008 Elsevier B.V. All rights reserved.

Percolation in a network with long-range connections: Implications for cytoskeletal structure and function

Cell shape, signaling, and integrity depend on cytoskeletal organization. In this study we describe the cytoskeleton as a simple network of filamentary proteins (links) anchored by complex protein structures (nodes). The structure of this network is regulated by a distance-dependent probability of link formation as P = p/d(s), where p regulates the network density and s controls how fast the probability for link formation decays with node distance (d). It was previously shown that the regulation of the link lengths is crucial for the mechanical behavior of the cells. Here we examined the ability of the two-dimensional network to percolate (i.e. to have end-to-end connectivity), and found that the percolation threshold depends strongly on s. The system undergoes a transition around s = 2. The percolation threshold of networks with s < 2 decreases with increasing system size L, while the percolation threshold for networks with s > 2 converges to a finite value. We speculate that s < 2 may represent a condition in which cells can accommodate deformation while still preserving their mechanical integrity. Additionally, we measured the length distribution of F-actin filaments from publicly available images of a variety of cell types. In agreement with model predictions, cells originating from more deformable tissues show longer F-actin cytoskeletal filaments. (C) 2008 Elsevier B.V. All rights reserved.

Efficient solutions to robust, semi-implicit discretizations of the immersed boundary method

The immersed boundary method is a versatile tool for the investigation of flow-structure interaction. In a large number of applications, the immersed boundaries or structures are very stiff and strong tangential forces on these interfaces induce a well-known, severe time-step restriction for explicit discretizations. This excessive stability constraint can be removed with fully implicit or suitable semi-implicit schemes but at a seemingly prohibitive computational cost. While economical alternatives have been proposed recently for some special cases, there is a practical need for a computationally efficient approach that can be applied more broadly. In this context, we revisit a robust semi-implicit discretization introduced by Peskin in the late 1970s which has received renewed attention recently. This discretization, in which the spreading and interpolation operators are lagged. leads to a linear system of equations for the inter-face configuration at the future time, when the interfacial force is linear. However, this linear system is large and dense and thus it is challenging to streamline its solution. Moreover, while the same linear system or one of similar structure could potentially be used in Newton-type iterations, nonlinear and highly stiff immersed structures pose additional challenges to iterative methods. In this work, we address these problems and propose cost-effective computational strategies for solving Peskin`s lagged-operators type of discretization. We do this by first constructing a sufficiently accurate approximation to the system`s matrix and we obtain a rigorous estimate for this approximation. This matrix is expeditiously computed by using a combination of pre-calculated values and interpolation. The availability of a matrix allows for more efficient matrix-vector products and facilitates the design of effective iterative schemes. We propose efficient iterative approaches to deal with both linear and nonlinear interfacial forces and simple or complex immersed structures with tethered or untethered points. One of these iterative approaches employs a splitting in which we first solve a linear problem for the interfacial force and then we use a nonlinear iteration to find the interface configuration corresponding to this force. We demonstrate that the proposed approach is several orders of magnitude more efficient than the standard explicit method. In addition to considering the standard elliptical drop test case, we show both the robustness and efficacy of the proposed methodology with a 2D model of a heart valve. (C) 2009 Elsevier Inc. All rights reserved.

The Aedes aegypti larval transcriptome: a comparative perspective with emphasis on trypsins and the domain structure of peritrophins

The genome sequence of Aedes aegypti was recently reported. A significant amount of Expressed Sequence Tags (ESTs) were sequenced to aid in the gene prediction process. In the present work we describe an integrated analysis of the genomic and EST data, focusing on genes with preferential expression in larvae (LG), adults (AG) and in both stages (SG). A total of 913 genes (5.4% of the transcript complement) are LG, including ion transporters and cuticle proteins that are important for ion homeostasis and defense. From a starting set of 245 genes encoding the trypsin domain, we identified 66 putative LG, AG, and SG trypsins by manual curation. Phylogenetic analyses showed that AG trypsins are divergent from their larval counterparts (LG), grouping with blood-induced trypsins from Anopheles gambiae and Simulium vittatum. These results support the hypothesis that blood-feeding arose only once, in the ancestral Culicomorpha. Peritrophins are proteins that interlock chitin fibrils to form the peritrophic membrane (PM) that compartmentalizes the food in the midgut. These proteins are recognized by having chitin-binding domains with 6 conserved Cys and may also present mucin-like domains (regions expected to be highly O-glycosylated). PM may be formed by a ring of cells (type 2, seen in Ae. aegypti larvae and Drosophila melanogaster) or by most midgut cells (type 1, found in Ae. aegypti adult and Tribolium castaneum). LG and D. melanogaster peritrophins have more complex domain structures than AG and T. castaneum peritrophins. Furthermore, mucin-like domains of peritrophins from T. castaneum (feeding on rough food) are lengthier than those of adult Ae. aegypti (blood-feeding). This suggests, for the first time, that type 1 and type 2 PM may have variable molecular architectures determined by different peritrophins and/or ancillary proteins, which may be partly modulated by diet.

Curiously composite structures of a retrotransposon and a complex repeat associated with chromosome ends of Rhynchosciara americana (Diptera: Sciaridae)

In Drosophila, telomere retrotransposons counterbalance the loss of telomeric DNA. The exceptional mechanism of telomere recovery characterized in Drosophila has not been found in lower dipterans (Nematocera). However, a retroelement resembling a telomere transposon and termed ""RaTART"" has been described in the nematoceran Rhynchosciara americana. In this work, DNA and protein sequence analyses, DNA cloning, and chromosomal localization of probes obtained either by PCR or by screening a genomic library were carried out in order to examine additional features of this retroelement. The analyses performed raise the possibility that RaTART represents a genomic clone composed of distinct repetitive elements, one of which is likely to be responsible for its apparent enrichment at chromosome ends. RaTART sequence in addition allowed to assess a novel subtelomeric region of R. americana chromosomes that was analyzed in this work after subcloning a DNA fragment from a phage insert. It contains a complex repeat that is located in the vicinity of simple and complex tandem repeats characterized previously. Quantification data suggest that the copy number of the repeat is significantly lower than that observed for the ribosomal DNA in the salivary gland of R. americana. A short insertion of the RaTART was identified in the cloned segment, which hybridized preferentially to subtelomeres. Like RaTART, it displays truncated sequences related to distinct retrotransposons, one of which has a conceptual translation product with significant identity with an endonuclease from a lepidopteran retrotransposon. The composite structure of this DNA stretch probably reflects mobile element activity in the subtelomeric region analyzed in this work.

Statistical coupling analysis of aspartic proteinases based on crystal structures of the Trichoderma reesei enzyme and its complex with pepstatin A

The crystal structures of an aspartic proteinase from Trichoderma reesei (TrAsP) and of its complex with a competitive inhibitor, pepstatin A, were solved and refined to crystallographic R-factors of 17.9% (R(free)=21.2%) at 1.70 angstrom resolution and 15.81% (R(free) = 19.2%) at 1.85 angstrom resolution, respectively. The three-dimensional structure of TrAsP is similar to structures of other members of the pepsin-like family of aspartic proteinases. Each molecule is folded in a predominantly beta-sheet bilobal structure with the N-terminal and C-terminal domains of about the same size. Structural comparison of the native structure and the TrAsP-pepstatin complex reveals that the enzyme undergoes an induced-fit, rigid-body movement upon inhibitor binding, with the N-terminal and C-terminal lobes tightly enclosing the inhibitor. Upon recognition and binding of pepstatin A, amino acid residues of the enzyme active site form a number of short hydrogen bonds to the inhibitor that may play an important role in the mechanism of catalysis and inhibition. The structures of TrAsP were used as a template for performing statistical coupling analysis of the aspartic protease family. This approach permitted, for the first time, the identification of a network of structurally linked residues putatively mediating conformational changes relevant to the function of this family of enzymes. Statistical coupling analysis reveals coevolved continuous clusters of amino acid residues that extend from the active site into the hydrophobic cores of each of the two domains and include amino acid residues from the flap regions, highlighting the importance of these parts of the protein for its enzymatic activity. (C) 2008 Elsevier Ltd. All rights reserved.

Morphometric analysis and taxonomic revision of the Vriesea paraibica complex (Bromeliaceae)

The species related to Vriesea paraibica (Bromeliaceae, Tillandsioideae) have controversial taxonomic limits. For several decades, this group has been identified in herbarium collections as V. x morreniana, an artificial hybrid that does not grow in natural habitats. The aim of this study was to assess the morphological variation in the V. paraibica complex through morphometric analyses of natural populations. Two sets of analyses were performed: the first involved six natural populations (G1) and the second was carried out on taxa that emerged from the first analysis, but using material from herbarium collections (G2). Univariate ANOVA was used, as well as discriminant analysis of 16 morphometric variables in G1 and 18 in G2. The results of the analyses of the two groups were similar and led to the selection of diagnostic traits of four species. Lengths of the lower and median floral bracts were significant for the separation of red and yellow floral bracts. Vriesea paraibica and V. interrogatoria have red bracts; these two species are differentiated by the widths of the lower and median portions of the inflorescence and by scape length. These structures are larger in the former and smaller in the latter. Of the species with yellow floral bracts, V. eltoniana is distinguished by longer leaf blades and scapes and V. flava is characterized by its shorter sepal lengths. (C) 2009 The Linnean Society of London, Botanical Journal of the Linnean Society, 2009, 159, 163-181.

Global analytic regularity for structures of co-rank one

We consider real analytic involutive structures V, of co-rank one, defined on a real analytic paracompact orientable manifold M. To each such structure we associate certain connected subsets of M which we call the level sets of V. We prove that analytic regularity propagates along them. With a further assumption on the level sets of V we characterize the global analytic hypoellipticity of a differential operator naturally associated to V. As an application we study a case of tube structures.

Sensitivity of complex networks measurements

Complex networks obtained from real-world networks are often characterized by incompleteness and noise, consequences of imperfect sampling as well as artifacts in the acquisition process. Because the characterization, analysis and modeling of complex systems underlain by complex networks are critically affected by the quality and completeness of the respective initial structures, it becomes imperative to devise methodologies for identifying and quantifying the effects of the sampling on the network structure. One way to evaluate these effects is through an analysis of the sensitivity of complex network measurements to perturbations in the topology of the network. In this paper, measurement sensibility is quantified in terms of the relative entropy of the respective distributions. Three particularly important kinds of progressive perturbations to the network are considered, namely, edge suppression, addition and rewiring. The measurements allowing the best balance of stability (smaller sensitivity to perturbations) and discriminability (separation between different network topologies) are identified with respect to each type of perturbation. Such an analysis includes eight different measurements applied on six different complex networks models and three real-world networks. This approach allows one to choose the appropriate measurements in order to obtain accurate results for networks where sampling bias cannot be avoided-a very frequent situation in research on complex networks.

On the efficiency of data representation on the modeling and characterization of complex networks

Specific choices about how to represent complex networks can have a substantial impact on the execution time required for the respective construction and analysis of those structures. In this work we report a comparison of the effects of representing complex networks statically by adjacency matrices or dynamically by adjacency lists. Three theoretical models of complex networks are considered: two types of Erdos-Renyi as well as the Barabasi-Albert model. We investigated the effect of the different representations with respect to the construction and measurement of several topological properties (i.e. degree, clustering coefficient, shortest path length, and betweenness centrality). We found that different forms of representation generally have a substantial effect on the execution time, with the sparse representation frequently resulting in remarkably superior performance. (C) 2011 Elsevier B.V. All rights reserved.

A complex network approach to text summarization

Automatic summarization of texts is now crucial for several information retrieval tasks owing to the huge amount of information available in digital media, which has increased the demand for simple, language-independent extractive summarization strategies. In this paper, we employ concepts and metrics of complex networks to select sentences for an extractive summary. The graph or network representing one piece of text consists of nodes corresponding to sentences, while edges connect sentences that share common meaningful nouns. Because various metrics could be used, we developed a set of 14 summarizers, generically referred to as CN-Summ, employing network concepts such as node degree, length of shortest paths, d-rings and k-cores. An additional summarizer was created which selects the highest ranked sentences in the 14 systems, as in a voting system. When applied to a corpus of Brazilian Portuguese texts, some CN-Summ versions performed better than summarizers that do not employ deep linguistic knowledge, with results comparable to state-of-the-art summarizers based on expensive linguistic resources. The use of complex networks to represent texts appears therefore as suitable for automatic summarization, consistent with the belief that the metrics of such networks may capture important text features. (c) 2008 Elsevier Inc. All rights reserved.

Seeking for simplicity in complex networks

Complex networks can be understood as graphs whose connectivity properties deviate from those of regular or near-regular graphs, which are understood as being ""simple"". While a great deal of the attention so far dedicated to complex networks has been duly driven by the ""complex"" nature of these structures, in this work we address the identification of their simplicity. The basic idea is to seek for subgraphs whose nodes exhibit similar measurements. This approach paves the way for complementing the characterization of networks, including results suggesting that the protein-protein interaction networks, and to a lesser extent also the Internet, may be getting simpler over time. Copyright (C) EPLA, 2009

Border trees of complex networks

The comprehensive characterization of the structure of complex networks is essential to understand the dynamical processes which guide their evolution. The discovery of the scale-free distribution and the small-world properties of real networks were fundamental to stimulate more realistic models and to understand important dynamical processes related to network growth. However, the properties of the network borders (nodes with degree equal to 1), one of its most fragile parts, remained little investigated and understood. The border nodes may be involved in the evolution of structures such as geographical networks. Here we analyze the border trees of complex networks, which are defined as the subgraphs without cycles connected to the remainder of the network (containing cycles) and terminating into border nodes. In addition to describing an algorithm for identification of such tree subgraphs, we also consider how their topological properties can be quantified in terms of their depth and number of leaves. We investigate the properties of border trees for several theoretical models as well as real-world networks. Among the obtained results, we found that more than half of the nodes of some real-world networks belong to the border trees. A power-law with cut-off was observed for the distribution of the depth and number of leaves of the border trees. An analysis of the local role of the nodes in the border trees was also performed.

Epidemics in networks of spatially correlated three-dimensional root-branching structures

Using digitized images of the three-dimensional, branching structures for root systems of bean seedlings, together with analytical and numerical methods that map a common susceptible-infected- recovered (`SIR`) epidemiological model onto the bond percolation problem, we show how the spatially correlated branching structures of plant roots affect transmission efficiencies, and hence the invasion criterion, for a soil-borne pathogen as it spreads through ensembles of morphologically complex hosts. We conclude that the inherent heterogeneities in transmissibilities arising from correlations in the degrees of overlap between neighbouring plants render a population of root systems less susceptible to epidemic invasion than a corresponding homogeneous system. Several components of morphological complexity are analysed that contribute to disorder and heterogeneities in the transmissibility of infection. Anisotropy in root shape is shown to increase resilience to epidemic invasion, while increasing the degree of branching enhances the spread of epidemics in the population of roots. Some extension of the methods for other epidemiological systems are discussed.

Selective excitation through tapered silica fibers of fluorescent two-photon polymerized structures

Two-photon polymerization has emerged as a powerful tool to design complex three-dimensional microstructures for applications ranging from biology to nanophotonics. To broaden the application spectrum of such microstructures, different materials have been incorporated to the polymers, aiming at specific applications. In this paper we report the fabrication of microstructures containing rhodamine 610, which display strong fluorescence upon one- and two-photon excitation. The latter increases light-penetration depth and spatial selectivity of luminescence. We also demonstrate that by using silica submicrometric wires we were able to select individual microstructures to be excited, which could be explored for designing microstructure-based optical circuits.