This is an announcement for the paper “Strong-partially greedy bases and Lebesgue-type inequalities” by Miguel Berasategui<https://arxiv.org/search/math?searchtype=author&query=Berasategui%2C+M>, Pablo M. Berná<https://arxiv.org/search/math?searchtype=author&query=Bern%C3%A1%2C+P+M>, Silvia Lasalle<https://arxiv.org/search/math?searchtype=author&query=Lasalle%2C+S>. Abstract: In this paper we continue the study of Lebsgue-type inequalities for the greedy algorithm. We introduce the notion of strong partially greedy Markushevich bases and study the Lebesguey-type parameters associated with them. We prove that this property is equivalent to that of being conservative and quasi-greedy, extending a similar result given in [9] for Schauder bases. We also give the characterization of 1-strong partial greediness, following the study started in [3,1]. The paper may be downloaded from the archive by web browser from URL https://arxiv.org/abs/2001.01226