Abstract
The paper reports a flow analysis framework for data exploration, knowledge discovery and visualization of large-scale Pedigrees represented as directed graphs. Indeed, when large Pedigrees are involved in biological studies researchers need to interact with multiple tools such as databases (storing genetic as well as phenotype information), graph browsers, graph visualization tools, etc.
We have already collected the last three centuries genealogical data of the population in the villages of Campora and Gioi, situated on the hills and mountains of the National Park of Cilento and Vallo of Diano, an area in the Southern Italy. At the present the villages have a population of 600 and 1200 residents respectively. The size of the today population as well as the collected genealogy requires sophisticated Software methods to support the storage, the handling, the analysis and the visualization of the data. In particular, visualization may become an impossible task when large Pedigrees need to be represented and browsed: very often the result is a screen cluttered by to much information.
The amount of collected information requires reliable and powerful soft-ware tools. The paper describes the key elements we are organizing into a Software system allowing to analyze, manage and visualize the large Pedigree. In particular, we report the structure of a database, the main framework inspired by flow analysis to extract properties from the pedigrees and a preliminary visualization tool based on GraphWiz the ATT graph visualization environment which allows to use applet to display graphs into WEB browser.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Sethi, R., Ullman, J.D.: Compilers. Principles Techniques and Tools. Addison-Wesley Publishing Company, Reading (1985)
Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: principles, techniques, tools. Addison-Wesley, Reading (1986)
Appel, A.W.: Modern Compiler Implementation in Java. Cambridge University Press, Cambridge (1998)
Atkinson, D.C., Griswold, W.G.: Implementation techniques for efficient dataflow analysis of large programs, To appear in ICSM 2001 (2001)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introductions to Algorithms. MIT Press, Cambridge (1990)
Duesterwald, E., Gupta, R., Soffa, M.L.: A practical framework for demand-driven interprocedural data flow analysis. ACM Transactions on Programming Languages and Systems 19(6), 992–1030 (1997)
Ganser, E., et al.: A technique for drawing directed graphs. IEEE Transactions on Software Engineering 19(3), 214–230 (1993)
Gallagher, K.B., Lyle, J.R.: Using program slicing for software maintenance. IEEE Transactions on Software Engineering 17(8), 751–761 (1991)
Horwitz, S., Reps, T., Binkley, D.: Interprocedural slicing using dependence graphs. ACM Transactions on Programming Languages and Systems 12(1), 26–60 (1990)
Kam, J.B., Ullman, J.D.: Global data flow analysis and iterative algorithms. Journal of the ACM 23(1), 158–171 (1976)
Kildall, G.A.: A unified approach to global program optimization. In: Conference Record of the ACM Symposium on Principles of Programming Languages, ACM SIGACT and SIGPLAN, pp. 194–206. ACM Press, New York (1973)
Komondoor, R., Horwitz, S.: Using slicing to identify duplication in source code. In: Proc. of the 8th International Symposium on Static Analysis (2001)
Reps, T.: Program analysis via graph reachability. Information and Software Technology 40(11-12), 701–726 (1998)
Sinha, S., Harrold, M.J., Rothermel, G.: System-dependence-graph-based slicing of programs with arbitrary interprocedural control flow. In: Proceedings of the 21st International Conference on Software Engineering, pp. 432–441 (1999)
Sinha, S., Harrold, M.J., Rothermel, G.: Computation of interprocedural control dependencies. ACM Transactions on Software Engineering and Methodology 10(2), 209–254 (2001)
Stirewalt, K., Dillon, L.: A component-based approach to building formal analysis tools. In: Proc. of IEEE International Conference on Software Engineering (2001)
Tip, F.: A survey of program slicing techniques. Journal of Programming Languages 3(3), 121–189 (1995)
Tonella, P., Antoniol, G., Merlo, E.: Flow insensitive C++ pointers and polymorphism analysis and its applications to slicing. In: Proceedings of International Conference on Software Engineering (ICSE), pp. 90–99 (1997)
Tores, F., Barillot, E.: Optimizing pedigree drawing using interval graph theory. Currents in Computational Molecular Biology, 194–195 (April 2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Antoniol, G. et al. (2003). Browsing Large Pedigrees to Study of the Isolated Populations in the “Parco Nazionale del Cilento e Vallo di Diano”. In: Apolloni, B., Marinaro, M., Tagliaferri, R. (eds) Neural Nets. WIRN 2003. Lecture Notes in Computer Science, vol 2859. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45216-4_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-45216-4_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20227-1
Online ISBN: 978-3-540-45216-4
eBook Packages: Springer Book Archive