BibTeX record conf/mfcs/LinJC02

download as .bib file

@inproceedings{DBLP:conf/mfcs/LinJC02,
  author       = {Yaw{-}Ling Lin and
                  Tao Jiang and
                  Kun{-}Mao Chao},
  editor       = {Krzysztof Diks and
                  Wojciech Rytter},
  title        = {Efficient Algorithms for Locating the Length-Constrained Heaviest
                  Segments, with Applications to Biomolecular Sequence Analysis},
  booktitle    = {Mathematical Foundations of Computer Science 2002, 27th International
                  Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2420},
  pages        = {459--470},
  publisher    = {Springer},
  year         = {2002},
  url          = {https://doi.org/10.1007/3-540-45687-2\_38},
  doi          = {10.1007/3-540-45687-2\_38},
  timestamp    = {Thu, 23 Jun 2022 19:57:06 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/LinJC02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.