Abstract
Let T = (V,E,w) be a rooted, undirected, and weighted tree with node set V and edge set E, where w(e) is an edge weight function for e∈E. The density of a path, say e 1, e 2, ..., e k , is defined as \(\sum^k_{i=1}w(e_i)\)/k. Given a tree with n edges, this paper presents two efficient algorithms for finding a maximum-density path of length at least L in O(nL) time. One of them is further modified to solve some special cases such as full m-ary trees in O(n) time.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arslan, A., Eğecioğlu, Ö., Pevzner, P.: A new approach to sequence comparison: normalized sequence alignment. Bioinformatics 17, 327–337 (2001)
Chao, K.-M., Hardison, R.C., Miller, W.: Recent Developments in Linear-Space Alignment Methods: a Survey. Journal of Computational Biology 1, 271–291 (1994)
Chao, K.-M.: On Computing all Suboptimal Alignments. Information Sciences 105, 189–207 (1998)
Gardiner-Garden, M., Frommer, M.: CpG islands in vertebrate genomes. J. Mol. Biol. 196, 261–282 (1987)
Goldwasser, M.H., Kao, M.-Y., Lu, H.-I.: Fast algorithms for finding maximumdensity segments of a sequence with applications to bioinformatics. In: Proceedings of the 2nd Workshop on Algorithms in Bioinformatics (WABI), pp. 157–171 (2002)
Huang, X.: An algorithm for identifying regions of a DNA sequence that satisfy a content requirement. CABIOS 10, 219–225 (1994)
Kim, S.K.: Linear-time algorithm for finding a maximum-density segment of a sequence. Information Processing Letters 86, 339–342 (2003)
Lin, Y.-L., Jiang, T., Chao, K.-M.: Efficient algorithms for locating the lengthconstrained heaviest segments. Journal of Computer and System Sciences 65, 570–586 (2002)
Lin, Y.-L., Huang, X., Jiang, T., Chao, K.-M.: MAVG: Locating Non-Overlapping Maximum Average Segments in a Given Sequence. Bioinformatics 19, 151–152 (2003)
Stojanovic, N., Florea, L., Riemer, C., Gumucio, D., Slightom, J., Goodman, M., Miller, W., Hardison, R.C.: Comparison of five methods for finding conserved sequences in multiple alignments of gene regulatory regions. Nucleic Acids Res. 27, 3899–3910 (1999)
Takai, D., Jones, P.A.: Comprehensive analysis of CpG islands in human chromosomes 21 and 22. PNAS 99, 3740–3745 (2002)
Wu, B.Y., Chao, K.-M., Tang, C.Y.: An efficient algorithm for the lengthconstrained heaviest path problem on a tree. Information Processing Letters 69, 63–67 (1999)
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
Lin, RR., Kuo, WH., Chao, KM. (2003). Finding a Length-Constrained Maximum-Density Path in a Tree. In: Ibaraki, T., Katoh, N., Ono, H. (eds) Algorithms and Computation. ISAAC 2003. Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24587-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-24587-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20695-8
Online ISBN: 978-3-540-24587-2
eBook Packages: Springer Book Archive