Efficient Algorithms for Finding Submasses in Weighted Strings. Bansal, N., Cieliebak, M., & Lipták, e. In Proc. of Combinatorial Pattern Matching Symposium (CPM 2004), volume 3109, of Lect Notes Comput Sci, pages 194–204, 2004. Springer, Berlin.
bibtex   
@InProceedings{bansal04efficient,
  author     = {Nikhil Bansal and Mark Cieliebak and {\relax Zs}uzsanna Lipt{\'a}k},
  title      = {Efficient Algorithms for Finding Submasses in Weighted Strings},
  booktitle  = {Proc. of Combinatorial Pattern Matching Symposium (CPM 2004)},
  year       = {2004},
  volume     = {3109},
  series     = lncs,
  pages      = {194--204},
  publisher  = Springer,
  file       = {BansalEtAl_EfficientAlgorithmsFindingSubmasses_CPM_2004.pdf:2004/BansalEtAl_EfficientAlgorithmsFindingSubmasses_CPM_2004.pdf:PDF},
  keywords   = {bielefeld, frobenius},
  optaddress = {Berlin, Germany},
}

Downloads: 0